Intuitive algorithms and t-vertex cover

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

Volumn 4288 LNCS, Issue , 2006, Pages 598-607

  Kneis, Joachim ^a   Mölle, Daniel ^a   Richter, Stefan ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXACT ALGORITHMS; FIXED-PARAMETER TRACTABILITY; NP-HARD PROBLEM; RANDOMIZED ALGORITHMS; RUNNING TIME; RUNTIMES; VERIFY ALGORITHMS; VERTEX COVER;

COMPUTATIONAL COMPLEXITY;

ALGORITHMS;

EID: 77249101367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_60     Document Type: Conference Paper

References (30)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Journal of Random structures and Algorithms, 3(3):289-304, 1992.
2. N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42(4): 844-856, 1995.
3. R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed parameter algorithm for vertex cover. Information Processing Letters, 65(3):163-168, 1998.
4. R. Beigel. Finding maximum independent sets in sparse and general graphs. In Proc. of 10th SODA, pages 856-857, 1999.
5. M. Blser. Computing small partial coverings. Information Processing Letters, 85:327-331, 2003.
6. N. H. Bshouty and L. Burroughs. Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In M. Morvan, C. Meinel, and D. Krob, editors, Proc. of 15th STAGS, number 1373 in LNCS, pages 298-308. Springer, 1998.
7. L. Cai, S. M. Chan, and S. O. Chan. Random separation: A new method for solving fixed-cardinality optimization problems. In Proc. of 2nd IWPEC, number 4169 in LNCS. Springer, 2006. To appear.
8. L. Cai, S. M. Chan, and S. O. Chan. Random separation: A new method for solving fixed-parameter problems. Manuscript, 2006.
9. L. Sunil Chandran and F. Grandoni. Refined memorization for vertex cover. Information Processing Letters, 93:125-131, 2005.
10. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
11. J. Chen, I. A. Kanj, and G. Xia. Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, School of CTI, DePaul University, 2005.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
13. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1: 195-207, 1972.
14. F. V. Fomin, F. Grandoni, and D. Kratsch. Measure and conquer: Domination - A case study. In Proc. of 32d ICALP, LNCS. Springer, 2005.
15. J. Guo, R. Niedermeier, and S. Wernicke. Parameterized complexity of generalized vertex cover problems. In Proc. of 9th WADS, number 3608 in LNCS, pages 36-48, Waterloo, Canada, 2005. Springer.
16. D. S. Hochbaum. The t-vertex cover problem: Extending the half integrality framework with budget constraints. In K. Jansen and D. S. Hochbaum, editors, Proc. of 1st APPROX, number 1444 in LNCS, pages 111-122. Springer, 1998.
17. K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. In Proc. of 15th SODA, pages 328-328, 2004.
18. J. Kneis, D. Mölle, S. Richter, and P. Rossmanith. Algorithms based on the treewidth of sparse graphs. In Proc. of 31st WG, number 3787 in LNCS, pages 385-396. Springer, 2005.
19. D. Mölle, S. Richter, and P. Rossmanith. Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. In Proc. of 1st CSR, number 3967 in LNCS, pages 270-280. Springer, 2006.
20. D. Mölle, S. Richter, and P. Rossmanith. A faster algorithm for the Steiner tree problem. In Proc. of 23rd STACS, number 3884 in LNCS, pages 561-570. Springer, 2006.
21. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. of 16th STACS, number 1563 in LNCS, pages 561-570. Springer, 1999.
22. R. Niedermeier and P. Rossmanith. On efficient fixed parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, 47:63-77, 2003.
23. E. Petrank. The hardness of approximation: Gap location. Computational Complexity, 4:133-157, 1994.
24. V. Raman and S. Saurabh. Triangles, 4-cycles and parameterized (in-) treatability. In Proc. of 10th SWAT, number 4059 in LNCS. Springer, 2006. To appear.
25. O. Reingold. Undirected ST-connectivity in Log-Space. In Proc. of 37th STOC, pages 376-385, 2005.
26. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7:425-440, 1986.
27. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proc. of 40th FOCS, pages 410-414, 1999.
28. A. Scott and G. B. Sorkin. Faster algorithms for Max-CUT and Max-CSP, with polynomial expected time for sparse instances. In Proc. of 7th RANDOM, number 2764 in LNCS, pages 382-395. Springer, 2003.
29. D. A. Spielman and S.-H. Teng. Smoothed analysis: Why the simplex algorithm usually takes polynomial time. In Proc. of 33d STOC, pages 296-305, 2001.
30. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. In Proc. of 31st ICALP, number 3142 in LNCS, pages 1227-1237. Springer, 2004.