Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Subscribe
Academic
Publications
On approximating arbitrary metrics by tree metrics
On approximating arbitrary metrics by tree metrics,Y. Bartal
Edit
On approximating arbitrary metrics by tree metrics
(
Citations: 117
)
BibTex

RIS

RefWorks
Download
Y. Bartal
Conference:
ACM Symposium on Theory of Computing  STOC
, 1996
Cumulative
Annual
Citation Context
(15)
...HSTs: Study of HSTs initially focused on approximating metrics using trees [2], [
3
], [7], while more recent work examines the way HSTs can enable efficient resource management and matching in sensor networks [9]...
...The original motivation for the HST was given by Bartal [2], [
3
], who proposed the idea of approximating metrics using a distribution over trees...
Arik Motskin
,
et al.
Network warehouses: Efficient information distribution to mobile users
...Using the fact that every graph metric can be probabilistically embedded into a tree with distortion O(log n) [
2
, 9], this yields an O(log n)approximation for TMMFL in general graphs in pseudopolynomial time...
Zachary Friggstad
,
et al.
Minimizing Movement in Mobile Facility Location Problems
...Probabilistic tree embeddings were introduced by Bartal [2], who showed that any metric can be approximated by a distribution over dominating tree metrics with distortion O(log 2 n). The bound was improved to O(log n log log n) in [
3
, 5] and to O(log n) in [12]...
Maleq Khan
,
et al.
Efficient distributed approximation algorithms via probabilistic tree ...
...The probabilistic embedding of [7] (and later improvements in [
8
, 22, 9]) provide in particular embeddings into L1 and serve as the first use of probabilistic partitions in the context of embeddings into normed spaces...
Ittai Abraham
,
et al.
Advances in metric embedding theory
...(Notice that this problem generalizes 0Extension by allowing an arbitrary assignment cost function c.) Motivated by applications to segmentation problems in computer vision, this problem was introduced by Kleinberg and Tardos [17], who proposed an approximation algorithm based on the approximate representation, due to Bartal [
3
], of (T, d) as a combination of dominating tree metrics...
Howard J. Karloff
,
et al.
On earthmover distance, metric labeling, and 0extension
Sort by:
Citations
(117)
Network warehouses: Efficient information distribution to mobile users
(
Citations: 1
)
Arik Motskin
,
Ian Downes
,
Branislav Kusy
,
Omprakash Gnawali
,
Leonidas Guibas
Conference:
IEEE INFOCOM  INFOCOM
, pp. 20692077, 2011
k Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
Yuval Emek
Journal:
Algorithmica
, vol. 61, no. 1, pp. 141160, 2011
Approximating
Danny Segev
Journal:
Journal of Combinatorial Optimization  JCO
, vol. 21, no. 3, pp. 364382, 2011
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model
(
Citations: 3
)
Matthew Andrews
,
Antonio Fernández
,
Lisa Zhang
,
Wenbo Zhao
Conference:
IEEE INFOCOM  INFOCOM
, pp. 2125, 2010
Genus and the Geometry of the Cut Graph
(
Citations: 2
)
James R. Lee
,
Anastasios Sidiropoulos
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 193201, 2010