780 search results - page 8 / 156 » Cost-Sharing Approximations for h |
COMGEO
2004
ACM
13 years 6 months ago
2004
ACM
COMPGEOM
2003
ACM
13 years 12 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
ALGORITHMICA
2005
13 years 6 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve