Refined memorization for vertex cover

Authors:
L. Sunil Chandran;Fabrizio Grandoni
Affiliations:
Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany;Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata", Via del Politecnico 1, I-00133 Rome, Italy and Max-Planck-Institut für Informatik, Stuhlsatzenhausweg ...
Venue:
Information Processing Letters
Year:
2005

Citing 10
Cited 10

Graph algorithms and NP-completeness

Graph algorithms and NP-completeness
Introduction to algorithms

Introduction to algorithms
Nondeterminism within P

SIAM Journal on Computing
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
A general method to speed up fixed-parameter-tractable algorithms

Information Processing Letters
Vertex cover: further observations and further improvements

Journal of Algorithms
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Upper bounds for vertex cover further improved

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity

Parameterized Complexity

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms
Minimum Leaf Out-Branching Problems

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A bounded search tree algorithm for parameterized face cover

Journal of Discrete Algorithms
On parameterized exponential time complexity

Theoretical Computer Science
Improved upper bounds for vertex cover

Theoretical Computer Science
Enumerate and expand: improved algorithms for connected vertex cover and tree cover

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Enumerate and expand: new runtime bounds for vertex cover variants

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Parameterized complexity of generalized vertex cover problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Distributed memorization for the k-vertex cover problem

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

Memorization 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.2832kk1.5 + kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorization, we obtain an O(1.2759kk1.5 + kn) algorithm for the same problem. We moreover show how to further reduce the complexity to O(1.2745kk4 + kn).