## Upper Bounds for Vertex Cover Further Improved (0)

### Cached

### Download Links

- [flop.informatik.tu-muenchen.de]
- [kam.mff.cuni.cz]
- [theinf1.informatik.uni-jena.de]
- DBLP

### Other Repositories/Bibliography

Citations: | 42 - 16 self |

### BibTeX

@MISC{Niedermeier_upperbounds,

author = {Rolf Niedermeier and Peter Rossmanith},

title = {Upper Bounds for Vertex Cover Further Improved},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

. The problem instance of Vertex Cover consists of an undirected graph G = (V; E) and a positive integer k, the question is whether there exists a subset C V of vertices such that each edge in E has at least one of its endpoints in C with jCj k. We improve two recent worst case upper bounds for Vertex Cover. First, Balasubramanian et al. showed that Vertex Cover can be solved in time O(kn + 1:32472 k k 2 ), where n is the number of vertices in G. Afterwards, Downey et al. improved this to O(kn+ 1:31951 k k 2 ). Bringing the exponential base significantly below 1:3, we present the new upper bound O(kn + 1:29175 k k 2 ). 1 Introduction Vertex Cover is a problem of central importance in computer science: { It was among the rst NP-complete problems [7]. { There have been numerous eorts to design ecient approximation algorithms [3], but it is also known to be hard to approximate [1]. { It is of central importance in parameterized complexity theory and has one ...