Sciweavers

100 search results - page 1 / 20
» Upper Bounds for Vertex Cover Further Improved
Sort
View
119
Voted
STACS
1999
Springer
15 years 6 months ago
Upper Bounds for Vertex Cover Further Improved
tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
Rolf Niedermeier, Peter Rossmanith
89
Voted
WG
1999
Springer
15 years 6 months ago
Vertex Cover: Further Observations and Further Improvements
Jianer Chen, Iyad A. Kanj, Weijia Jia
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 3 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
89
Voted
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
Bart M. P. Jansen, Hans L. Bodlaender