Refined memorisation for vertex cover

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

Volumn 3162, Issue , 2004, Pages 61-70

  Sunil Chandran, L ^a   Grandoni, Fabrizio ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

RECURSIVE ALGORITHMS; SPACE COMPLEXITY; SPEED UP; TIME COMPLEXITY; VERTEX COVER;

PARAMETER ESTIMATION;

EID: 35048861833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. R. Balasubramanian, M. Fellows, and V. Raman. An improved fixed - parameter algorithm for vertex cover. Information Processing Letters, 65:163-168, 1998.
2. J. F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22(3):560-572, 1993.
3. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
4. T. H, Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw - Hill Book Company, 6th edition, 1992.
5. R. G. Downey and M. R. Fellows. Fixed - parameter tractability and completeness. II. On completeness for W[1]. Theoretical Computer Science, 141(1-2):109-131, 1995.
6. R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer - Verlag, 1999.
7. R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In J. K. F. Roberts and J. Nesetril, editors, Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 49-99, 1999.
8. M. R. Fellows. On the complexity of vertex set problems. Technical report, Computer Science Department, University of New Mexico, 1988.
9. K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NPCompleteness. Springer-Verlag, 1984.
10. R. Niedermeier and P. Rossmanith. Upper bounds for vertex cover further improved. In Symposium on Theoretical Aspects of Computer Science, pages 561-570, 1999.
11. R. Niedermeier and P. Rossmanith. A general method to speed up fixed - parametertractable algorithms. Information Processing Letters, 73(3-4):125-129, 2000.
12. R. Niedermeier and P. Rossmanith. Private communication, 2003.
13. R. Niedermeier and P. Rossmanith. On efficient fixed - parameter algorithms for weighted vertex cover. Journal of Algorithms, 47(2):63-77, 2003.
14. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986.
15. n/4). Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001.