Recently, there have been increasing interests and progresses in lowering the worst case time complexity for well-known NP-hard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several simple and new techniques are introduced, which lead to an improved algorithm of time O(kn + 1:271 k
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
468
|
Parameterized Complexity
– Downey, Fellows
- 1999
|
|
127
|
A Local Ratio Theorem for Approximating the Weighted Vertex Cover Problem
– Bar-Yehuda, Even
- 1985
|
|
80
|
Vertex packing: structural properties and algorithms
– Nemhauser, Trotter
- 1975
|
|
79
|
Fixed-parameter tractability and completeness I: Basic theory
– Downey, Fellows
- 1995
|
|
72
|
Algorithms for maximum independent sets
– Robson
|
|
61
|
Parameterized computational feasibility
– Downey, Fellows
- 1993
|
|
61
|
Parameterized Complexity: A Framework for Systematically Confronting
– Downey, Fellows, et al.
- 1999
|
|
57
|
Nondeterminism within P
– Buss, Goldsmith
- 1993
|
|
54
|
Upper bounds for vertex cover further improved
– Niedermeier, Rossmanith
- 1999
|
|
50
|
New methods for 3-SAT decision and worst-case analysis
– Kullmann
- 1999
|
|
50
|
Finding a maximum independent set
– Tarjan, Trojanowski
|
|
37
|
3-coloring in time O(1:3446 n ): a no-MIS algorithm
– Beigel, Eppstein
- 1995
|
|
34
|
Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. In Approximation Algorithms for NP-hard Problems
– Hochbaum
- 1997
|
|
29
|
Finding maximum independent sets in sparse and general graphs
– Beigel
- 1999
|
|
27
|
A general method to speed up fixed-parametertractable algorithms
– Niedermeier, Rossmanith
- 2000
|
|
24
|
Deterministic algorithms for k-SAT based on covering codes and local search
– Dantsin, Goerdt, et al.
|
|
21
|
An improved fixed parameter algorithm for vertex cover
– Balasubramanian, Fellows, et al.
- 1998
|
|
20
|
An O(20:304n) algorithm for solving maximum independent set problem
– Jian
|
|
13
|
An improved fixed-parameter-tractable algorithm for vertex cover
– Stege, Fellows
- 1999
|
|
8
|
An improved parameter algorithm for vertex cover
– Balasubramanian, Fellows, et al.
- 1998
|
|
8
|
A simple algorithm for finding a maximum clique and its worst-case time complexity
– Shindo, Tomita
|
|
7
|
Vertex cover revisited: A hybrid algorithm of theory and heuristic
– Hallett, Gonnet, et al.
- 1998
|
|
4
|
Improvement on Vertex Cover for low-degree graphs, Networks 35
– Chen, Liu, et al.
- 2000
|
|
1
|
A simple algorithm for a maximum clique and its worst-case time complexity, Sys
– Shindo, Tomita
- 1990
|
|
1
|
Vertex Cover: Exact and Approximate Algorithms and Applications
– Kanj
- 2001
|
|
1
|
A probabilistic approach for k-SAT and constraint satisfaction problems
– Schöning
- 1999
|
|
