Crown reductions for the Minimum Weighted Vertex Cover problem

Discrete Applied Mathematics

Volumn 156, Issue 3, 2008, Pages 292-312

  Chlebík, Miroslav ^a   Chlebíková, Janka ^b  

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

^b Physics and Informatics   (Slovakia)

Author keywords

Crown reductions; Nemhauser Trotter theorem; Vertex cover

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FINITE DIFFERENCE METHOD; LINEAR PROGRAMMING; PROBLEM SOLVING;

CROWN REDUCTIONS; NEMHAUSER-TROTTER THEOREM; VERTEX COVER;

LOGIC PROGRAMMING;

EID: 38049085688     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.026     Document Type: Article

References (37)

1. F.N. Abu-Khzam, R.L. Collins, M.R. Fellows, M.A. Langston, W.H. Sutters, C.T. Symons, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69.
2. F.N. Abu-Khzam, M.A. Langston, W.H. Sutters, Fast, effective vertex cover kernelization: a tale of two algorithms, in: Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, Cairo, Egypt, January 2005.
3. Berge C. Regularizable graphs, Advances in graph theory. Ann. Discrete Math. 3 (1978) 11-19
4. Berman P., and Fujito T. On approximation properties of the indepenedent set problem for low degree graphs. Theory Comput. Systems 32 (1999) 115-132
5. Boros E., Golumbic M.C., and Levit V.E. On the number of vertices belonging to all maximum stable sets of a graph. Discrete Appl. Math. 124 1-3 (2002) 17-25
6. Bourjolly J.-M., Hammer P.L., and Simeone B. Node-weighted graphs having the König-Egerváry property. Math. Programming Stud. 22 (1984) 44-63
7. Bourjolly J.M., and Pulleyblank W.R. König-Egerváry graphs, 2-bicritical graphs and fractional matchings. Discrete Appl. Math. 24 (1989) 63-82
8. Buss J.F., and Goldsmith J. Nondeterminism within P. SIAM J. Comput. 22 3 (1993) 560-573
9. Chang G.J., and Zhu X. Pseudo-Hamiltonian-connected graphs. Discrete Appl. Math. 100 (2000) 145-153
10. Chen J., and Kanj I.A. On constrained minimum vertex covers of bipartite graphs: improved algorithms. J. Comput. System. Sci. 67 (2003) 833-847
11. Chen J., Kanj I.A., and Jia W. Vertex cover: further observations and further improvements. J. Algorithms 41 (2001) 280-301
12. Chlebík M., and Chlebíková J. Minimum 2SAT-DELETION problem: inapproximability results and relations to Minimum Vertex Cover. Discrete Appl. Math. 155 2 (2007) 172-179
13. M. Chlebík, J. Chlebíková, Optimal version of Nemhauser-Trotter Theorem, in: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Lecture Notes in Computer Science, 3111, 2004, pp. 174-186.
14. 2) steps, in: Proceedings of the 30th International Workshop on Graph Theoretic Concepts in Computer Science (WG'04), Lecture Notes in Computer Science, vol. 3353, 2004, pp. 257-269.
15. F. Dehne, M. Fellows, F. Rosamond, An FPT algorithm for set splitting, in: Proceedings of 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG'03), Lecture Notes in Computer Science, vol. 2880, 2003, pp. 180-191.
16. F. Dehne, M. Fellows, F. Rosamond, P. Shaw, Greedy localization, iterative compression, and modeled crown reductions: new FTP Techniques, and improved algorithm for set splitting, and a novel 2 k kernelization for vertex cover, in: Proccedings of the International Workshop on Parametrized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science, vol. 3162, 2004, pp. 271-280.
17. I. Dinur, S. Safra, The importance of being biased, in: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC'02), 2002, pp. 33-42.
18. Downey R.G., and Fellows M.R. Parametrized Complexity (1999), Springer, Berlin
19. M. Fellows, P. Heggernes, F. Rosamond, C. Sloper, J.A. Telle, Exact algorithms for finding k disjoint triangles in an arbitrary graph, in: Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG'04), Lecture Notes in Computer Science, vol. 3353, 2004, pp. 235-244.
20. M.R. Fellows, Blow-ups, win/win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG'03), Lecture Notes in Computer Science, vol. 2880, 2003, pp. 1-12.
21. H. Fernau, On parameterized enumeration, in: Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON'02), Lecture Notes in Computer Science, vol. 2383, 2002, pp. 564-573.
22. Goldberg A.V., and Tarjan R.E. A new approach to the maximum-flow problem. J. ACM 35 (1988) 921-940
23. Hall P. On representatives of subsets. J. London Math. Soc. 10 (1935) 26-30
24. Hammer P.L., Hansen P., and Simeone B. Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Algebraic Discrete Methods 3 4 (1982) 511-522
25. 2.5) algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2 (1973) 225-231
26. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, 1976.
27. Lovász L., and Plummer M.D. Matching Theory (1986), North-Holland, Amsterdam
28. L. Mathieson, E. Prieto, P. Shaw, Packing edge disjoint triangles: a parametrized view, in: Proccedings of the International Workshop on Parametrized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science, vol. 3162, 2004, pp. 127-137.
29. S. Micali, V.V. Vazirani, An O (sqrt(| V |) | E |) algorithm for finding maximum matching in general graphs, in: Proceedings of the 21st IEEE Symposium on Foundation of Computer Science, Syracuse, New York, 1980, pp. 17-27.
30. Nemhauser G.L., and Trotter L.E. Properties of vertex packing and independence system polyhedra. Math. Programming 6 (1974) 48-61
31. Nemhauser G.L., and Trotter L.E. Vertex packings: structural properties and algorithms. Math. Programming 8 (1975) 232-248
32. Niedermeier R., and Rossmanith P. On efficient fixed parameter algorithms for weighted vertex cover. J. Algorithms 47 2 (2003) 63-77
33. Picard J.C., and Queyranne M. On the integer valued variables in the linear vertex packing problem. Math. Programming 12 (1977) 97-101
34. E. Prieto, C. Sloper, Either/or: using vertex cover structure in designing FTP algorithms-the case of k-internal spanning tree, in: Proceedings of the Workshop on Algorithms and Data Structures (WADS'03), Lecture Notes in Computer Science, 2748, 2003, pp. 474-483.
35. E. Prieto, C. Sloper, Looking at the stars, in: Proceedings of the International Workshop on Parametrized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science, vol. 3162, 2004, pp. 138-148.
36. Pulleyblank W.R. Minimum node covers and 2-bicritical graphs. Math. Programming 17 (1979) 91-103
37. Schrijver A. Combinatorial Optimization (2003), Springer, Berlin