Improved upper bounds for vertex cover

Theoretical Computer Science

Volumn 411, Issue 40-42, 2010, Pages 3736-3756

  Chen, Jianer ^a   Kanj, Iyad A ^b   Xia, Ge ^c  

^a Texas A and M University   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c LAFAYETTE COLLEGE   (United States)

Author keywords

Branch and search; NP complete problem; Parameterized algorithm; Vertex cover

Indexed keywords

AMORTIZED ANALYSIS; BRANCH-AND-SEARCH; BRANCHING RULES; NP COMPLETE PROBLEMS; PARAMETERIZED ALGORITHM; SPACE ALGORITHMS; TIME POLYNOMIALS; UPPER BOUND; VERTEX COVER;

COMPUTATIONAL COMPLEXITY;

ALGORITHMS;

EID: 78049448178     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.06.026     Document Type: Article

References (34)

1. DIMACS Workshop on Faster Exact Algorithms for NP-hard problems. Princeton, NJ, 2000.
2. R. Balasubramanian, M. Fellows, and V. Raman An improved fixed parameter algorithm for Vertex cover Information Processing Letters 65 1998 163 168
3. R. Bar-Yehuda, and S. Even A local-ratio theorem for approximating the weighted vertex cover problem Annals of Discrete Mathematics 25 1985 27 46
4. J. Buss, and J. Goldsmith Nondeterminism within P SIAM Journal on Computing 22 1993 560 572
5. L. Cai, and D. Juedes On the existence of subexponential parameterized algorithms Journal of Computer and System Sciences 67 4 2003 789 807
6. L. Chandran, and F. Grandoni Refined memorisation for vertex cover Information Processing Letters 93 3 2005 125 131
7. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, and P. Taillon Solving large FPT problems on coarse grained parallel machines Journal of Computer and System Sciences 67 4 2003 691 706
8. J. Chen, I. Kanj, and W. Jia Vertex cover: further observations and further improvements Journal of Algorithms 41 2001 280 301
9. J. Chen, L. Liu, and W. Jia Improvement on vertex cover for low degree graphs Networks 35 2000 253 259
10. Jianer Chen, Iyad A. Kanj, and Ge Xia Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems Algorithmica 43 4 2005 245 273
11. M. Chlebik, and J. Chlebikova Crown reductions for the minimum weighted vertex cover problem Discrete Applied Mathematics 156 2008 292 312
12. Benny Chor, Mike Fellows, and David W. Juedes Linear kernels in linear time, or how to save k colors in O (n 2 ) steps Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science vol. 3353 2004 Springer 257 269
13. Frank K.H.A. Dehne, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover Proceedings of the 1st International Workshop on Parameterized and Exact Computation Lecture Notes in Computer Science vol. 3162 2004 Springer 271 280
14. R. Diestel Graph Theory Graduate Textbooks in Mathematics vol. 173 1997 Springer
15. R. Downey, and M. Fellows Fixed-parameter tractability and completeness Congressus Numerantium 87 1992 161 187
16. R. Downey, and M. Fellows Parameterized Complexity 1999 Springer New York
17. C. Ebengger, P.L. Hammer, and D. de Werra Pseudo-Boolean functions and stability of graphs Annals of Discrete Mathematics 19 1984 83 98
18. M. Fellows Blow-ups, win/win's and crown rules: some new directions in FPT 29th International Workshop on Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science vol. 2880 2003 1 12
19. Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, and Jan Arne Telle Finding k disjoint triangles in an arbitrary graph Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science vol. 3353 2004 Springer 235 244
20. F. Fomin, F. Grandoni, and D. Kratsch A measure & conquer approach for the analysis of exact algorithms J. ACM 56 5 2009 1 32
21. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch Measure and conquer: Domination a case study Proceedings of the 32nd International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science vol. 3580 2005 Springer 191 203
22. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman New York
23. R. Impagliazzo, and R. Paturi Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63 2001 512 530
24. D.S. Johnson, M.A. Tricks, Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenges vol. 26 1996 American Mathematical Society Providence, RI
25. Luke Mathieson, Elena Prieto, and Peter Shaw Packing edge disjoint triangles: A parameterized view Proceedings of the 1st International Workshop on Parameterized and Exact Computation Lecture Notes in Computer Science vol. 3162 2004 Springer 127 137
26. G. Nemhauser, and L. Trotter Vertex packings: structural properties and algorithms Mathematical Programming 8 1975 232 248
27. R. Niedermeier, and P. Rossmanith Upper bounds for vertex cover further improved Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science vol. 1563 1999 561 570
28. R. Niedermeier, and P. Rossmanith A general method to speed up fixed-parameter-tractable algorithms Information Processing Letters 73 34 2000 125 129
29. R. Niedermeier, and P. Rossmanith On efficient fixed-parameter algorithms for weighted vertex cover Journal of Algorithms 47 2003 63 77
30. Elena Prieto, and Christian Sloper Either/or: Using vertex cover structure in designing FPT-algorithms the case of k-internal spanning tree Proceedings of the 8th International Workshop on Algorithms and Data Structures Lecture Notes in Computer Science vol. 2748 2003 Springer 474 483
31. Elena Prieto, and Christian Sloper Looking at the stars Proceedings of the 1st International Workshop on Parameterized and Exact Computation Lecture Notes in Computer Science vol. 3162 2004 Springer 138 148
32. J.M. Robson Algorithms for maximum independent sets Journal of Algorithms 7 1986 425 440
33. U. Stege, M. Fellows, An improved fixed-parameter-tractable algorithm for vertex cover. Technical Report 318, Department of Computer Science, ETH Zrich, April 1999.
34. Gerhard J. Woeginger Open problems around exact algorithms Discrete Applied Mathematics 156 3 2008 397 405