Primal-dual approximation algorithms for feedback problems in planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 147-161

  Goemans, Michel X ^a   Williamson, David P ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; GRAPHIC METHODS; INTEGER PROGRAMMING; SET THEORY;

FEEDBACK PROBLEMS; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; GRAPH BIPARTIZATION; MINIMUM WEIGHT; PRIMAL-DUAL APPROXIMATION ALGORITHM; PRIMAL-DUAL METHODS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84947912813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_12     Document Type: Conference Paper

References (24)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24:440-456, 1995.
2. Akiyama and Watanabe. Research problem. Graphs and Combinatorics, 3:201-202, 1986.
3. M. Albertson and D. Berman. A conjecture on planar graphs. In J. Bondy and U. Murty, editors, Graph Theory and Related Topics. Academic Press, 1979.
4. V. Bafna, P. Berman, and T. Rijito. Constant ratio approximation of the weighted feedback vertex set problem for undirected graphs. In J. Staples, P. Eades, N. Katoh, and A. Moffat, editors, ISAAC '95 Algorithms and Computation, volume 1004 of Lecture Notes in Computer Science, pages 142-151, 1995.
5. R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344-354, 1994.
6. A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, pages 60-68, 1994.
7. O. Borodin. On acyclic colorings of planar graphs. Discrete Mathematics, 25:211-236, 1979.
8. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multi-cuts in directed graphs. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, volume 920 of Lecture Notes in Computer Science, pages 14-28. Springer-Verlag, 1995.
9. G. Even, J. Naor, B. Schieber, and L. Zosin. Approximating minimum subset feedback sets in undirected graphs with applications to multicuts. Manuscript, 1995.
10. M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
11. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, in Proceedings of the 20th International Colloquium on Automata, Languages and Programming, 1993. To appear in Algorithmica under the title "Primal-dual approximation algorithms for integral flow and multi cut in trees".
12. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 698-707, 1993. To appear in SIAM J. Comp.
13. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995.
14. M. X. Goemans and D. P. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 4. PWS, Boston, 1996. Forthcoming.
15. D. S. Hochbaum. Good, better, best, and better than best approximation algorithms. In D. S, Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 9. PWS, Boston, 1996. Forthcoming.
16. T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley and Sons, New York, 1995.
17. P. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica, 15:187-202, 1995.
18. P. Klein and R. Ravi. When cycles collapse: A general approximation technique for constrained two-connectivity problems. In Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, pages 39-55, 1993. Also appears as Brown University Technical Report CS-92-30.
19. T. Leighton and S, Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988.
20. G. L. Nemhauser and L. E. Yotter Jr. Vertex packing: Structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
21. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15:281-288, 1995.
22. H. Stamm. On feedback problems in planar digraphs. In R. Möhring, editor, Graph-Theoretic Concepts in Computer Science, number 484 in Lecture Notes in Computer Science, pages 79-89. Springer-Verlag, 1990.
23. D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15:435-454, 1995.
24. M. Yannakakis. Node and edge-deletion NP-complete problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pages 253-264, May 1978.