1632 search results - page 25 / 327 » Sublinear Time Algorithms for Metric Space Problems |
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
102
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
149
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
144
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
109
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...