Enumerate and expand: Improved algorithms for connected vertex cover and tree cover

Theory of Computing Systems

Volumn 43, Issue 2, 2008, Pages 234-253

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Enumerate and expand; Exact algorithms; Parameterized complexity; Vertex cover

Indexed keywords

CONNECTED VERTEX COVER; ENUMERATE AND EXPAND; EXACT ALGORITHMS; GRAPH PROBLEMS; PARAMETERIZED COMPLEXITY; STEINER TREE PROBLEM; VERTEX COVER; VERTEX COVER PROBLEMS;

ALGORITHMS;

FORESTRY;

EID: 41849134325     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9089-3     Document Type: Article

References (13)

1. Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed parameter algorithm for vertex cover. Inf. Process. Lett. 65(3), 163-168 (1998)
2. Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Inf. Process. Lett. 93, 125-131 (2005)
3. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41, 280-301 (2001)
4. Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: improved upper bounds for vertex cover. Technical Report TR05-008, School of CTI, DePaul University (2005)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
6. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195-207 (1972)
7. Fernau, H.: On parameterized enumeration. In: Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 2387, pp. 564-573. Springer, New York (2002)
8. Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: complexity and algorithms. Technical Report TR-2006-210, Dept. of Computing Science, University of Glasgow (April 2006)
9. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), Waterloo, Canada. Lecture Notes in Computer Science, vol. 3608, pp. 36-48. Springer, New York (2005)
10. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: new runtime bounds for vertex cover variants. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 4112. Springer, New York (2006)
11. Mölle, D., Richter, S., Rossmanith, P.: A faster algorithm for the Steiner tree problem. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 3884, pp. 561-570. Springer, New York (2006)
12. Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 1563, pp. 561-570. Springer, New York (1999)
13. Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for weighted vertex cover. J. Algorithms 47, 63-77 (2003)