Abstract
The enumerate-and-expand paradigm for solving NP-hard problems has been introduced and applied to some Vertex Cover variants in a recently published preliminary paper. In this paper we improve on the runtime for Connected Vertex Cover, obtaining a bound of O *(2.7606k), and use the technique in order to gain the fastest known method for counting the number of vertex covers in a graph, which takes O *(1.3803k) time.
Supported by the DFG under grant RO 927/6-1 (TAPI).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed parameter algorithm for vertex cover. Information Processing Letters 65(3), 163–168 (1998)
Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Information Processing Letters 93, 125–131 (2005)
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
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)
Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1972)
Fernau, H.: On parameterized enumeration. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)
Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitation thesis, Universität Tübingen (2005)
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)
Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. EATCS Bulletin 87, 47–77 (2005)
Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen (May 2005)
Fuchs, B., Kern, W., Mölle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum steiner trees. Theory of Computing Systems (to appear, 2006)
Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. In: Proc. of 1st CSR (to appear, 2006)
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)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation thesis, Universität Tübingen (2002)
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)
Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for Weighted Vertex Cover. Journal of Algorithms 47, 63–77 (2003)
Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10(4), 529–550 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mölle, D., Richter, S., Rossmanith, P. (2006). Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_29
Download citation
DOI: https://doi.org/10.1007/11809678_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)