Sciweavers

Share
IPL
2010
134views more  IPL 2010»
8 years 2 months ago
Parameterized algorithm for eternal vertex cover
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, D...
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
8 years 7 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
PDCN
2004
8 years 8 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
COCOA
2008
Springer
8 years 9 months ago
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
Zhao Zhang, Xiaofeng Gao, Weili Wu
AUSAI
2005
Springer
8 years 9 months ago
Understanding the Pheromone System Within Ant Colony Optimization
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
Stephen Gilmour, Mark Dras
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
8 years 9 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
8 years 10 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
ICALP
2010
Springer
9 years 1 days ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
9 years 22 days ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
9 years 22 days ago
The Multi-radius Cover Problem
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
Refael Hassin, Danny Segev
books