Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics

DOI10.1007/978-3-540-73420-8_81MaRDI QIDQ5428872zbMATH OpenOpenAlexFDO

Authors Matthew Cary, Atri Rudra, Ashish Sabharwal

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_81

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Automata, Languages and Programming
• Hardness of Embedding Metric Spaces of Equal Size
• Inapproximability for metric embeddings into $\mathbb{R}^{d}$
• Approximation algorithms for minimizing average distortion
• Hardness and approximation of minimum distortion embeddings

Cited in

(2)

• Automata, Languages and Programming
• Corrigendum: Metric Embedding via Shortest Path Decompositions

This page was built for publication: Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics

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