Improved parameterized upper bounds for vertex cover

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

Volumn 4162 LNCS, Issue , 2006, Pages 238-249

  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

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

TIME POLYNOMIALS; UPPER BOUNDS; VERTEX COVER;

BOUNDARY CONDITIONS;

EID: 33750070292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_21     Document Type: Conference Paper

References (20)

1. R. Balasubramanian, M. Fellows, and V. Raman. An improved fixed parameter algorithm for Vertex Cover. Information Processing Letters, 65:163-168, 1998.
2. 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.
3. J. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560-572, 1993.
4. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences, 67(4):789-807, 2003.
5. L. Chandran and F. Grandoni. Refined memorisation for vertex cover. In Proceedings of the 1st International Workshop on Parameterized and Exact Computation, volume 3162 of Lecture Notes in Computer Science, pages 61-70, 2004.
6. 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):691-706, 2003.
7. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
8. J. Chen, L. Liu, and W. Jia. Improvement on Vertex Cover for low degree graphs. Networks, 35:253-259, 2000.
9. M. Chlebik and J. Chlebikova. Crown reductions for the minimum weighted vertex cover problem. In Electronic Colloquium on Computational Complexity, Report No. 101, 2004.
10. R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium, 87:161-187, 1992.
11. R. Downey and M. Fellows. Parameterized Complexity. Springer, New York, 1999.
12. Ch. Ebengger, P. Hammer, and D. de Werra. Pseudo-boolean functions and stability of graphs. Annals of Discrete Mathematics, 19:83-98, 1984.
13. M. Fellows. Blow-ups, win/win's and crown rules: some new directions in FPT. In 29th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 2880 of Lecture Notes in Computer Science, pages 1-12, 2003.
14. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
15. R. Impagliazzo and R. Paturi. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63:512-530, 2001.
16. G. Nemhauser and L. Trotter. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
17. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 561-570, 1999.
18. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms, 47:63-77, 2003.
19. J. M. Robson. Algorithms for maximum independent set. Journal of Algorithms, 6:425-440, 1977.
20. U. Stege and M. Fellows. An improved fixed-parameter-tractable algorithm for Vertex Cover. Technical Report 318, Department of Computer Science, ETH Zürich, April 1999.