scientific article; zbMATH DE number 2079366

MaRDI QIDQ4471325zbMATH OpenFDO

Authors Manor Mendel, Yair Bartal

Publication date 28 July 2004

zbMATH Keywords

group Steiner treemetrical task systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Multiembedding of Metric Spaces
• A tight bound on approximating arbitrary metrics by tree metrics
• Approximation algorithms for embedding general metrics into trees
• A tight bound on approximating arbitrary metrics by tree metrics
• Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion

Cited in

(9)

• Maximum gradient embeddings and monotone clustering
• Ramsey-type theorems for metric spaces with applications to online problems
• Measured descent: A new embedding method for finite metrics
• Online embeddings
• Maximum Gradient Embeddings and Monotone Clustering
• Multiembedding of Metric Spaces
• Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
• A tight bound on approximating arbitrary metrics by tree metrics
• Adaptive-adversary-robust algorithms via small copy tree embeddings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471325)