Vertex cover approximations: Experiments and observations

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 545-557

  Asgeirsson, Eyjolfur ^a   Stein, Cliff ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

APPROXIMATION RATIO; TEST GRAPHS; VERTEX COVER APPROXIMATION;

APPROXIMATION THEORY;

EID: 24944572173     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_47     Document Type: Conference Paper

References (22)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. Proceedings, ACM-SIAM Workshop on Algorithm Engineering and Experiments, 2004.
2. R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed-parameter algorithm for vertex cover. Information Processing Letters, 65:163-168, 1998.
3. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Disc. Math., 25:27-46, 1985.
4. DIMACS Implementation Challenges. Center for Discrete Mathematics & Theoretical Computer Science. ftp://dimacs.rutgers.edu/pub/challenge/graph/ benchmarks/.
5. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41(2):280-301, 2001.
6. B.V. Cherkassky, A.V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi. Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. Technical Report 98-036R, NEC Research Institute, Inc., 1998.
7. P. Crescenzi and V. Kann. A compendium of NP optimization problems. http://www.nada.kth.se/theory/problemlist.html.
8. I. Dinur and S. Safra. The importance of being biased. Proc. 34th Ann. ACM Symp. on Theory of Comp., pages 33-42, 2002.
9. P. Erdös and T. Gallai. On the minimal number of vertices representing the edges of a graph. Publ. Math. Inst. Hungar. Acad. Sci., 6:181-202, 1961.
10. U. Feige. Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, Computer Science and Applied Mathematics, The Weizmann Institute of Science, 2003.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Fransisco, 1979.
12. A. Goldberg. Andrew Goldberg's Network Optimization Library, http://www.avglab.com/andrew/soft.html.
13. M. M. Halldórsson. Approximating discrete collections via local improvements. Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 160-169, 1995.
14. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 329-337, 2000.
15. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
16. D. S. Hochbaum. Approximation Algorithms for NP-hard Problems. PWS, 1997.
17. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
18. B. Monien and E. Speckenmeyer. Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Inf., 22:115-123, 1985.
19. G. L. Nemhauser and L. E. Trotter. Vertex packing: Structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
20. R. Niedermeier and P. Rossmanith. On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover. Journal of Algorithms, 47:63-77, 2003.
21. L.A Sanchis. Test Case Construction for the Vertex Cover Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 15, 1994.
22. M. Truszczynski, N. Leone, and I. Niemela. Benchmark problems for answer set programming systems, http://www.cs.uky.edu/ai/benchmarks.html.