Improved parameterized upper bounds for vertex cover

Authors:
Jianer Chen;Iyad A. Kanj;Ge Xia
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL;Department of Computer Science, Lafayette College, Easton, PA
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 10
Cited 26

Nondeterminism within P

SIAM Journal on Computing
An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
Vertex cover: further observations and further improvements

Journal of Algorithms
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Solving large FPT problems on coarse-grained parallel machines

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
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

Parameterized Algorithms for Generalized Domination

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
On parameterized exponential time complexity

Theoretical Computer Science
On Parameterized Exponential Time Complexity

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Exponential-time approximation of weighted set cover

Information Processing Letters
Fixed-parameter evolutionary algorithms and the vertex cover problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Parameterized learnability of juntas

Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Iterative compression and exact algorithms

Theoretical Computer Science
The union of minimal hitting sets: parameterized combinatorial bounds and counting

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The complexity of finding subgraphs whose matching number equals the vertex cover number

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Capacitated domination and covering: a parameterized perspective

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parameterized algorithm for eternal vertex cover

Information Processing Letters
Solving MINONES-2-SAT as fast as VERTEX COVER

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The curse of connectivity: t-total vertex (edge) cover

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Algorithmic meta-theorems for restrictions of treewidth

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Isomorphism of (mis)labeled graphs

ESA'11 Proceedings of the 19th European conference on Algorithms
Slightly superexponential parameterized problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Backdoors to tractable answer-set programming

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover

Discrete Optimization
The impact of parameterized complexity to interdisciplinary problem solving

The Multivariate Algorithmic Revolution and Beyond
Parameterized approximation via fidelity preserving transformations

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Cluster vertex deletion: a parameterization between vertex cover and clique-width

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Distributed memorization for the k-vertex cover problem

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Parallel vertex cover: a case study in dynamic load balancing

AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for Vertex Cover improving the previous O(1.286k + kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745kk4 + kn)-time exponential-space upper bound for the problem by Chandran and Grandoni.