Advertisement

Vertex Cover Approximations: Experiments and Observations

  • Eyjolfur Asgeirsson
  • Cliff Stein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)

Abstract

The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, each of which guarantees an approximation ratio of \(\frac{3}{2}\), to find approximate vertex covers for a large collection of test graphs from various sources. We explain these reductions and explore the interaction between them. These reductions are extremely fast and even though they, by themselves are not guaranteed to find a vertex cover, we manage to find a 3/2-approximate vertex cover for every single graph in our large collection of test examples.

Keywords

Approximation Ratio Vertex Cover Extended Network Original Graph Linear Programming Relaxation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Eyjolfur Asgeirsson
    • 1
  • Cliff Stein
    • 1
  1. 1.Department of IEORColumbia UniversityNew York

Personalised recommendations