Improvement of Nemhauser-Trotter Theorem and its applications in parametrized complexity

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

Volumn 3111, Issue , 2004, Pages 174-186

  Chleb́ik, Miroslav ^a   Chlebíková, Janka ^b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

FIXED-PARAMETER ALGORITHMS; INTEGER PARAMETERS; ITS APPLICATIONS; MINIMUM VERTEX COVER; PARAMETRIZED COMPLEXITY; POLYNOMIAL-TIME; VERTEX COVER PROBLEMS; VERTEX- WEIGHTS;

GRAPH THEORY;

EID: 33750278346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_16     Document Type: Article

References (15)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters and C. T. Symons, Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments, Proceeding of Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January, 2004.
2. J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM Journal on Computing 22(3)(1993), 560-573.
3. B. Chor, M. Fellows and D. Juedes, An efficient FPT algorithm for saving k colors, Manuscript, 2003.
4. J. Chen, I. A. Kanj and W. Jia, Vertex cover: further observations and further improvements, Journal of Algorithms 41(2001), 280-301.
5. J. Chen and I. A. Kanj, On constrained minimum vertex covers of bipartite graphs: improved algorithms, Journal of Computer Systems Sci. 67(2003), 833-847.
6. F. Dehne, M. Fellows and F. Rosamond, An FPT algorithm for set splitting, LNCS 2880 (WG'03), pp. 180-191, 2003.
7. I. Dinur and S. Safra, The importance of being biased, STOC, 2002, pp. 33-42.
8. H. Fernau, On parameterized enumeration, LNCS 2383 (COCOON'02), pp. 564-573, 2002.
9. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, Journal of ACM 35(1988), 921-940.
10. 2.5) algorithm for maximum matching in bipartite graphs, SIAM J. Computing 2(1973), 225-231.
11. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, 1976.
12. L. Lovász and M. D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.
13. S. Micali and V. V. Vazirani, An O(√|V||E|) algorithm for finding maximum matching in general graphs, Proc. of 21st IEEE Symposium on Foundation of Computer Science, Syracuse, New York, 1980, pp. 17-27.
14. G. L. Nemhauser and L. E. Trotter, Vertex packings: structural properties and algorithms, Math. Programming 8(1975), 232-248.
15. R. Niedermeier and P. Rossmanith, On efficient fixed parameter algorithms for weighted vertex cover, Journal of Algorithms 47(2) (2003), 63-77.