Vertex cover approximations on random graphs

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

Volumn 4525 LNCS, Issue , 2007, Pages 285-296

  Asgeirsson, Eyjolfur ^a   Stein, Cliff ^b  

^a REYKJAVIK UNIVERSITY   (Iceland)

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

APPROXIMATE VERTEX; APPROXIMATION RATIO; GRAPH TRANSFORMATIONS; VERTEX COVER PROBLEM;

GRAPH THEORY;

EID: 37149004639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_22     Document Type: Conference Paper

References (12)

1. Asgeirsson, E., Stein, C.: Vertex cover approximations: Experiments and observations. WEA, pp. 545-557 (2005)
2. Cook, S.: The complexity of theorem proving procedures. In: Proceedings of the third annual ACM symposium on Theory of computing, pp. 151-158 (1971)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge, MA, USA (2001)
4. Crescenzi, P., Kann, V.: A compendium of NP optimization problems. http://www.nada.kth.se/theory/problemlist.html
5. Dinur, I., Safra, S.: The importance of being biased. In: Proc. 34th Ann. ACM Symp. on Theory of Comp. pp. 33-42 (2002)
6. 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)
7. Erdös, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290-297 (1959)
8. 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)
9. Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243-254 (1983)
10. Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, Springer, Heidelberg (2005)
11. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85-103. Plenum Press (1972)
12. Monien, B., Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Inf. 22, 115-123 (1985)