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

DOI10.1007/978-3-540-73420-8_81zbMath1171.68485OpenAlexW1488007166MaRDI QIDQ5428872

Ashish Sabharwal, Atri Rudra, Matthew Cary

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

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

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