3875 search results - page 143 / 775 » Approximation algorithms for the 0-extension problem |
105
click to vote
APPROX
2007
Springer
15 years 11 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...
134
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
177
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
115
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
188
click to vote
TSMC
2010
14 years 11 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...