Abstract
We regret to report that we have found an error in our paper "On the Hardness of Embeddings Between Two Finite Metrics," which appeared in the Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Lisboa, Portugal, July 2005. In that paper, we sought to prove NP-hardness of approximating the minimum distortion when one finite metric is embedded into another. While the fairly involved reduction we presented was correct, the Directed Disjoint Cycle Cover (DDCC) problem we were reducing from has a polynomial-time algorithm, as noticed later by Jiri Sgall. Despite much effort, we have not been able to find an alternate reduction, and it remains open whether our claimed hardness of approximation results still hold. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Cary, M., Rudra, A., & Sabharwal, A. (2007). Paper retraction: On the hardness of embeddings between two finite metrics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, p. 949). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
