52 search results - page 1 / 11 » Primal-Dual Approximation Algorithms for Feedback Problems |
90
Voted
IPCO
1996
14 years 10 months ago
1996
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
97
Voted
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
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...
SIAMCOMP
1998
14 years 9 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
92
Voted
IPCO
2001
14 years 11 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...