Sciweavers

300 search results - page 1 / 60
» Vertex Cover: Further Observations and Further Improvements
Sort
View
STACS
1999
Springer
13 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
ICALP
2005
Springer
13 years 8 months ago
A Better Approximation Ratio for the Vertex Cover Problem
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
George Karakostas
MFCS
2010
Springer
13 years 27 days ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
MICS
2010
102views more  MICS 2010»
13 years 27 days ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan