Abstract
Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixed-parameter vertex cover, whose time complexity is O(1.2832k k 1.5+kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorisation, we obtain a O(1.2759k k 1.5+kn) algorithm for the same problem. We moreover show how to further reduce the complexity to O(1.2745k k 4+kn).
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.
Similar content being viewed by others
References
Balasubramanian, R., Fellows, M., Raman, V.: An improved fixed-parameter algorithm for vertex cover. Information Processing Letters 65, 163–168 (1998)
Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22(3), 560–572 (1993)
Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, 6th edn. MIT Press and McGraw-Hill Book Company (1992)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoretical Computer Science 141(1-2), 109–131 (1995)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, Heidelberg (1999)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Roberts, J.K.F., Nesetril, J. (eds.) Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49–99 (1999)
Fellows, M.R.: On the complexity of vertex set problems. Technical report, Computer Science Department, University of New Mexico (1988)
Mehlhorn, K.: Data Structures and Algorithms 2: Graph Algorithms and NPCompleteness. Springer, Heidelberg (1984)
Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Symposium on Theoretical Aspects of Computer Science, pp. 561–570 (1999)
Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parametertractable algorithms. Information Processing Letters 73(3–4), 125–129 (2000)
Niedermeier, R., Rossmanith, P.: Private communication (2003)
Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms 47(2), 63–77 (2003)
Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425–440 (1986)
Robson, J.M.: Finding a maximum independent set in time O(2n/4). Technical Report 1251-01, LaBRI, Université Bordeaux I (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandran, L.S., Grandoni, F. (2004). Refined Memorisation for Vertex Cover. In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive