Advertisement

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

  • Daniel Mölle
  • Stefan Richter
  • Peter Rossmanith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3967)

Abstract

We present a new method of solving graph problems related to VERTEX COVER by enumerating and expanding appropriate sets of nodes. As an application, we obtain dramatically improved runtime bounds for two variants of the VERTEX COVER problem: In the case of CONNECTED VERTEX COVER, we take the upper bound from O *(6 k ) to O *(3.2361 k ) without large hidden factors. For TREE COVER, we show exactly the same complexity, improving vastly over the previous bound of O *((2k) k ). In the process, faster algorithms for solving subclasses of the Steiner tree problem on graphs are investigated.

Keywords

Tree Cover Steiner Tree Vertex Cover Graph Class Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed parameter algorithm for vertex cover. Inf. Process. Lett. 65(3), 163–168 (1998)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Inf. Process. Lett. 93, 125–131 (2005)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)MathSciNetCrossRefMATHGoogle Scholar
  4. 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)Google Scholar
  5. 5.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)CrossRefMATHGoogle Scholar
  6. 6.
    Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1972)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Fernau, H.: On parameterized enumeration. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36–48. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Mölle, D., Richter, S., Rossmanith, P.: A faster algorithm for the Steiner tree problem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 561–570. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Niedermeier, R., Rossmanith, P.: Upper bounds for Vertex Cover further improved. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 561–570. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for Weighted Vertex Cover. Journal of Algorithms 47, 63–77 (2003)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Daniel Mölle
    • 1
  • Stefan Richter
    • 1
  • Peter Rossmanith
    • 1
  1. 1.Dept. of Computer ScienceRWTH Aachen UniversityGermany

Personalised recommendations