Refined memorization for vertex cover

Information Processing Letters

Volumn 93, Issue 3, 2005, Pages 125-131

  Chandran, L Sunil ^a   Grandoni, Fabrizio ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Computational complexity; Memorization; Vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA PROCESSING; GRAPH THEORY; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

FIXED-PARAMETER ALGORITHMS; KERNEL REDUCTION; MEMORIZATION; VERTEX CORNER;

COMPUTATIONAL COMPLEXITY;

EID: 10444285111     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.10.003     Document Type: Article

References (15)

1. R. Balasubramanian, M. Fellows, V. Raman, An improved fixed-parameter algorithm for vertex cover, Inform. Process. Lett. 65 (1998) 163-168.
2. J.F. Buss, J. Goldsmith, Nondeterminism within P, SIAM J. Comput. 22 (3) (1993) 560-572.
3. J. Chen, I. Kanj, W. Jia, Vertex cover: further observations and further improvements, J. Algorithms 41 (2001) 280-301.
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, sixth ed., MIT Press/McGraw-Hill, 1992.
5. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness. II. On completeness for W[1], Theoret. Comput. Sci. 141 (1-2) (1995) 109-131.
6. R.G. Downey, M.R. Fellows, Parameterized Complexity, Monographs in Computer Science, Springer-Verlag, Berlin, 1999.
7. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, in: J.K.F. Roberts, J. Nesetril (Eds.), Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, 1999, pp. 49-99.
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 NP-Completeness, Springer-Verlag, Berlin, 1984.
10. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: Symposium on Theoretical Aspects of Computer Science, 1999, pp. 561-570.
11. R. Niedermeier, P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Inform. Process. Lett. 73 (3-4) (2000) 125-129.
12. R. Niedermeier, P. Rossmanith, Private communication, 2003.
13. R. Niedermeier, P. Rossmanith, On efficient fixed-parameter algorithms for weighted vertex cover, J. Algorithms 47 (2) (2003) 63-77.
14. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (3) (1986) 425-440.
15. n/4), Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001.