300 search results - page 1 / 60 » Vertex Cover: Further Observations and Further Improvements |
WG
1999
Springer
14 years 3 months ago
1999
Springer
STACS
1999
Springer
14 years 3 months ago
1999
Springer
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...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
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...
MFCS
2010
Springer
13 years 9 months ago
2010
Springer
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...
MICS
2010
13 years 9 months ago
2010
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...