How to trim an MST: A 2-approximation algorithm for minimum cost tree cover

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

Volumn 4051 LNCS, Issue , 2006, Pages 431-442

  Fujito, Toshihiro ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COSTS; GRAPHIC METHODS; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; MINIMUM COST TREE COVER PROBLEM; MINIMUM SPANNING TREE (MST); PRIMAL-DUAL SCHEMA;

TREES (MATHEMATICS);

EID: 33746365149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_38     Document Type: Conference Paper

References (17)

1. E.M. Arkin, M.M. Halldórsson and R. Hassin. Approximating the tree and tour covers of a graph. Inform. Process. Lett., 47:275-282, 1993.
2. R. Bar-Yehuda. One for the price of two: A unified approach for approximating covering problems. Algorithmica, 27(2):131-144, 2000.
3. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27-46, 1985.
4. R. Bar-Yohudn and D. Rawitz. On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Discrete Math., 19(3): 762-797, 2005.
5. F.A. Chudak, M.X. Goemans, D.S. Hochbaum, and D.P. Williamson. A primaldual interpretation of recent 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. Res. Lett., 22:111-118, 1998.
6. I. Dinur and S. Safra. The importance of being biased. In Proc. 34th ACM Symp. Theory of Computing, pages 33-42, 2002.
7. J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards B, 71:233-240, 1967.
8. T. Fujito. On approximability of the independent/connected edge dominating set problems. Inform. Process. Lett., 79(6):261-266, 2001.
9. T. Fujito and H. Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math., 118:199-207, 2002.
10. D.R. Fulkerson. Packing rooted directed cuts in a weighted directed graph. Math. Programming, 6:1-13, 1974.
11. M.R. Garey and D.S. Johnson. The rectilinear Steiner-tree problem is NP-complete. SIAM J. Appl. Math., 32(4):826-834, 1977.
12. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput., 31(5): 1608-1623, 2002.
13. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 - ε. In Proc. 18th IEEE Conf. Computational Complexity, pages 379-386, 2003.
14. J. Könemann, G. Konjevod, O. Parekh and A. Sinha. Improved approximations for tour and tree covers. Algorithmica, 38(3): 441-449, 2003.
15. B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informat., 22:115-123, 1985.
16. O. Parekh. Edge dominating and hypomatchable sets. In Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pages 287-291, 2002.
17. C. Savage. Depth-first search and the vertex cover problem. Inform. Process. Lett., 14(5):233-235, 1982.