780 search results - page 7 / 156 » Cost-Sharing Approximations for h |
STOC
2009
ACM
14 years 7 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
CCCG
2010
13 years 8 months ago
2010
Let
CCCG
2004
13 years 8 months ago
2004
ADCM
2004
13 years 6 months ago
2004
We give an algebraic interpretation of the well