Sciweavers

Share
92 search results - page 1 / 19
» Approximation algorithms for partially covering with edges
Sort
View
TCS
2008
8 years 10 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
9 years 3 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
9 years 4 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ICALP
2001
Springer
9 years 2 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ACID
2006
220views Algorithms» more  ACID 2006»
8 years 11 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
books