Sciweavers

31 search results - page 2 / 7
» Approximating Additive Distortion of Embeddings into Line Me...
Sort
View
IPL
2008
95views more  IPL 2008»
13 years 5 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
COMPGEOM
2006
ACM
13 years 11 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
13 years 11 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 5 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
RANDOM
2001
Springer
13 years 9 months ago
On Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala