Sciweavers

41 search results - page 4 / 9
» Girth and euclidean distortion
Sort
View
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 5 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
FOCS
2005
IEEE
14 years 1 months ago
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Ked...
COMPGEOM
2006
ACM
14 years 1 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
STACS
2007
Springer
14 years 2 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
ECML
2005
Springer
14 years 1 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen