Parameterized complexity of Vertex Cover Variants

Theory of Computing Systems

Volumn 41, Issue 3, 2007, Pages 501-520

  Guo, Jiong ^a   Niedermeier, Rolf ^a   Wernicke, Sebastian ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; CONNECTED VERTEX COVER; CONSTANT-FACTOR APPROXIMABILITY; COVER PROBLEM; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; VERTEX COVER;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 36849035332     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-1309-3     Document Type: Conference Paper

References (44)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langsten, W. H. Suters, and C. T. Symons. Kernelization algorithms for the Vertex Cover problem: theory and experiments. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX '04), pages 62-69. ACM/SIAM, New York/Philadelphia, PA, 2004.
2. F. N. Abu-Khzam, M. A. Langsten, P. Shanbhag, and C. T. Symons. Scalable parallel algorithms for FPT problems. Algorithmica, 45:269-284, 2006.
3. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier. Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica, 33(4):461-493, 2002.
4. J. Alber, F. Dorn, and R. Niedermeier. Experimental evaluation of a tree decomposition based algorithm. for Vertex Cover on planar graphs. Discrete Applied Mathematics, 145(2):219-231, 2005.
5. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. Journal of Algorithms, 52:26-56, 2004.
6. J. Alber, J. Gramm, and R. Niedermeier. Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics, 229:3-27, 2001.
7. E. M. Arkin, M. M. Halldörsson, and R. Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47(6):275-282, 1993.
8. V. Arvind and V. Raman. Approximation algorithms for some parameterized counting problems. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC '02), volume 2518 of LNCS, pages 453-464. Springer, Berlin, 2002.
9. R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed-parameter algorithm, for Vertex Cover. Information Processing Letters, 65(3): 163-168, 1998.
10. M. Bläser. Computing small partial coverings. Information Processing Letters, 85(6):327-331, 2003.
11. 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 Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS '98), volume 1373 of LNCS, pages 298-308. Springer, Berlin, 1998.
12. L. Cai. Parameterized complexity of cardinality constrained optimization problems. Manuscript, May 2005.
13. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences, 67(4):789-807, 2003.
14. L. S. Chandran and F. Grandoni. Refined memorisation for Vertex Cover. Information Processing Letters, 93(3):125-131, 2005.
15. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, and P. J. Taillon. Solving large FPT problems on coarse-grained parallel machines. Journal of Computer and System Sciences, 67(4):691-706, 2003.
16. J. Chen, I. A. Kanj, and W. Jia. Vertex Cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
17. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for Vertex Cover. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS '06), volume 4162 of LNCS, pages 238-294. Springer, Berlin, 2007.
18. Y. Chen, J. Flum, and M. Grohe. Machine-based methods in parameterized complexity theory. Theo-retical Computer Science, 339(2-3): 167-199, 2005.
19. J. Chuzhoy and J. S. Naor. Covering problems with hard capacities. SIAM Journal on Computing, 36(2):498-515, 2006.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition. MIT Press, Cambridge, MA, 2001.
21. P. Damascheke. Parameterized enumeration, transversals, and imperfect phytogeny reconstruction. The-oretical Computer Science, 351(3):337-350, 2006.
22. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, New York, 1999.
23. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195-207, 1972.
24. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proceedings of the ith Workshop on Algorithms and Data Structures (WADS '03), volume 2748 of LNCS, pages 505-520. Springer, Berlin, 2003.
25. H. Fernau. On parameterized enumeration. In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON '02), volume 2383 of LNCS, pages 564-573. Springer, Berlin, 2002.
26. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, Berlin, 2006.
27. R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan. An improved approximation al-gorithm, for Vertex Cover with, hard capacities. Journal of Computer and System Sciences, 72:16-33, 2006.
28. S. E. Goodman and S. T. Hedetniemi. On Hamiltonian walks in graphs. SIAM Journal on Computing, 3(3):214-221, 1974.
29. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. Primal-dual based distributed algorithms for Vertex Cover with, semi-hard capacities. In Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '05), pages 118-125, 2005.
30. S. Guha, R. Hassin, S. Khuller, and E. Or. Capacitated vertex covering. Journal of Algorithms, 48(1):257-270, 2003.
31. E. Halperin and A. Srinivasan. Improved approximation algorithm for the Partial Vertex Cover problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX '02), volume 2462 of LNCS, pages 161-174. Springer, Berlin, 2002.
32. C. Hierholzer. Über die Möglichkeit, einen. .Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen, 6:30-32, 1873.
33. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum, New York, 1972.
34. J. Könemann, G. Konjevod, O. Parekh, and A. Sinha. Improved approximations for tour and tree covers. Algorithmica, 38(3):441-449, 2004.
35. D. Mölle, S. Richter, and P. Rossmanith. A faster algorithm, for the Steiner Tree problem. In Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS '06), volume 3884 of LNCS, pages 561-570. Springer, Berlin, 2006.
36. D. Mölle, S. Richter, and P. Rossmanith. Enumerate and expand: improved algorithms for Connected Vertex Cover and Tree Cover. In Proceedings of the 1st International Computer Science Symposium in Russia (CSR '06), volume 3967 of LNCS, pages 270-280. Springer, Berlin, 2006.
37. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford, 2006.
38. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In. Proceedings of the \6th Symposium on Theoretical Aspects of Computer Science (STACS '99), volume 1563 of LNCS, pages 561-570. Springer, Berlin, 1999.
39. R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters, 73:125-129, 2000.
40. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, 47(2):63-77, 2003.
41. N. Nishimura, P. Ragde, and D. M. Thilikos. Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discrete Applied Mathematics, 152(1-3):229-245, 2005.
42. E. Prieto and C. Sloper. Either/or: using vertex cover structure in designing FPT-algorithms-the case of k-Internal Spanning Tree. Nordic Journal of Computing, 12(3):308-318, 2005.
43. H. J. Prömel and A. Steger. The Steiner Tree Problem. Vieweg-Verlag, Braunschweig, 2002.
44. C. D. Savage. Depth-first search and the vertex cover problem. Information Processing Letters, 14(5):233-237, 1982.