179 search results - page 5 / 36 » On Approximating the Average Distance Between Points |
WADS
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
ANOR
2006
13 years 7 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...