{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:25:46Z","timestamp":1787340346522,"version":"build-2736575974"},"reference-count":50,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>We initiate the study of the minimum distortion problem: Given as input two n-point metric spaces, find a bijection between them with minimum distortion. This is an abstraction of certain geometric problems in shape and image matching and is also a natural variation and extension of the fundamental problems of graph isomorphism and bandwidth. Our focus is on algorithms that find an optimal (or near-optimal) bijection when the distortion is fairly small. We present a polynomial time algorithm that finds an optimal bijection between two line metrics, provided the distortion is less than $5+2\\sqrt{6}\\approx9.9$. We also give a parameterized polynomial time algorithm that finds an optimal bijection between an arbitrary unweighted graph metric and a bounded-degree tree metric.<\/jats:p>","DOI":"10.1137\/080712921","type":"journal-article","created":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T18:06:06Z","timestamp":1261591566000},"page":"1617-1636","source":"Crossref","is-referenced-by-count":7,"title":["Low Distortion Maps Between Point Sets"],"prefix":"10.1137","volume":"39","author":[{"given":"Claire","family":"Kenyon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Rabani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alistair","family":"Sinclair","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,12,23]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.06.016"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00282-2"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"L. Babai, D. Y. Grigoryev, and D. M. Mount,\n                      Isomorphism of graphs with bounded eigenvalue multiplicity\n                      , in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, pp. 310\u2013324.","DOI":"10.1145\/800070.802206"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"M. Badoiu, J. Chuzhoy, P. Indyk, and A. Sidiropoulos,\n                      Low-distortion embeddings of general metrics into the line\n                      , in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 225\u2013233.","DOI":"10.1145\/1060590.1060624"},{"key":"R5","unstructured":"=.23em plus .1em minus .1em M. Badoiu, K. Dhamdhere, A. Gupta, Y. Rabinovich, H. Raecke, R. Ravi, and A. Sidiropoulos,\n                      Approximation algorithms for low-distortion embeddings into low-dimensional spaces\n                      , in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 119\u2013128."},{"key":"R6","unstructured":"M. Badoiu, P. Indyk, and A. Sidiropoulos,\n                      Approximation algorithms for embedding general metrics into trees\n                      , in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 512\u2013521."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"R. Bellman,\n                      Introduction to Matrix Analysis\n                      , 2nd ed., SIAM, Philadelphia, 1997.","DOI":"10.1137\/1.9781611971170"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/34.993558"},{"key":"R9","unstructured":"G. Blache, M. Karpinski, and J. Wirtgen,\n                      On approximation intractability of the bandwidth problem\n                      , Electronic Colloquium on Computational Complexity technical report TR98-014, 1998."},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00181-4"},{"key":"R11","unstructured":"N. Chandran, R. Moriarty, R. Ostrovsky, O. Pandey, and A. Sahai,\n                      Improved algorithms for optimal embeddings\n                      , Electronic Colloquium on Computational Complexity technical report TR06-110, 2006."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"B. Chazelle, D. Liu, and A. Magen,\n                      Sublinear geometric algorithms\n                      , in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 531\u2013540.","DOI":"10.1145\/780542.780620"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060302"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"M. Deza and M. Laurent,\n                      Geometry of Cuts and Metrics\n                      , Algorithms and Combinatorics 15, Springer, New York, 1997.","DOI":"10.1007\/978-3-642-04295-9"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"R. Downey,\n                      Parameterized complexity for the skeptic\n                      , in Proceedings of the 18th IEEE Conference on Computational Complexity, 2003, pp. 147\u2013169.","DOI":"10.1109\/CCC.2003.1214417"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"R. Downey, M. Fellows, and U. Stege,\n                      Parameterized complexity: a framework for systematically confronting computational intractability\n                      ,\n                      Contemporary Trends in Discrete Mathematics\n                      , AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 49, R. Graham, J. Kratochvil, J. Nesetril, and F. Roberts, eds. American Mathematical Society, Providence, RI, 1999, pp. 49\u201399.","DOI":"10.1090\/dimacs\/049\/04"},{"key":"R18","unstructured":"W. Evans and M. A. Safari,\n                      K\n                      -Separable Permutations and their Applications to Metric Embedding, Pattern Matching, and Stack Sorting\n                      , manuscript, 2005."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188585"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1682"},{"key":"R21","unstructured":"U. Feige and R. Krauthgamer,\n                      Improved performance guarantees for bandwidth minimization heuristics\n                      , unpublished manuscript, 1998."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"U.  Feige and K. Talwar,\n                      Approximating the bandwidth of caterpillars\n                      , in Proceedings of the APPROX 2005, Springer Lecture Notes in Computer Science 3624, Springer, New York, pp. 62\u201373.","DOI":"10.1007\/11538462_6"},{"key":"R23","unstructured":"S. Fortin,\n                      The graph isomorphism problem\n                      , Technical report 96-20, University of Alberta, Edomonton, Alberta, Canada, 1996."},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/0134037"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1118"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"A. Hall and C.H. Papadimitriou,\n                      Approximating the distortion\n                      , in Proceedings of the APPROX-RANDOM, 2005, Springer Lecture Notes in Computer Science 3624, Springer, New York, pp. 111\u2013122.","DOI":"10.1007\/11538462_10"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02090396"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"F. Hoffmann, K. Kriegel, and C. Wenk,\n                      Matching 2D patterns of protein spots\n                      , in Proceedings of the 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 231\u2013239.","DOI":"10.1145\/276884.276911"},{"key":"R30","doi-asserted-by":"crossref","unstructured":".28em plus .1em minus .1em J. Hopcroft and J. Wonk,\n                      A linear time algorithm for isomorphism of planar graphs\n                      , in Proceedings of the 6th Annual ACM Symposium on Theory of Computing, 1974, pp. 172\u2013184.","DOI":"10.1145\/800119.803896"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"W.L. Hsu, $O(M\\ast N)$\n                      algorithms for the recognition and isomorphism problems on circular-arc graphs\n                      , SIAM J. Comput. 24 (1995), pp. 411\u2013439.","DOI":"10.1137\/S0097539793260726"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1109\/34.232073"},{"key":"R33","unstructured":"P. Indyk,\n                      Algorithmic aspects of geometric embeddings\n                      , Tutorial presented at 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, http:\/\/theory.lcs.mit.edu\/~indyk\/tut.html."},{"key":"R34","unstructured":"W. B. Johnson and J. Lindenstrauss, eds.\n                      Handbook of the Geometry of Banach Spaces\n                      . North-Holland, Amsterdam, 2003."},{"key":"R35","unstructured":"M. Karpinski, J. Wirtgen, and A. Zelikovsky,\n                      An approximation algorithm for the bandwidth problem on dense graphs\n                      , Electronic Colloquium on Computational Complexity technical report number TR97-017, 1997."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"C. Kenyon, Y. Rabani, and A. Sinclair,\n                      Low distortion maps between point sets\n                      , in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 272\u2013280.","DOI":"10.1145\/1007352.1007398"},{"key":"R37","doi-asserted-by":"crossref","unstructured":"J. Kobler, U. Sch\u00f6ning, and J. Toran,\n                      The Graph Isomorphism Problem: Its Structural Complexity\n                      , Progress in Theoretical Computer Science, Birkh\u00e4user, Boston, 1993.","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90028-9"},{"key":"R39","doi-asserted-by":"crossref","unstructured":"N. Linial,\n                      Finite metric spaces\u2014combinatorics, geometry and algorithms\n                      , in Proceedings of the of the International Congress of Mathematicians III, Beijing, 2002, pp. 573\u2013586.","DOI":"10.1145\/513400.513441"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2004.04.002"},{"key":"R43","doi-asserted-by":"crossref","unstructured":"J. Matous\u02d8ek,\n                      Lectures on Discrete Geometry\n                      , Graduate Texts in Mathematics 212, Springer, New York, 2002.","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"R44","doi-asserted-by":"crossref","unstructured":"G. Miller,\n                      Isomorphism testing for graphs of bounded genus\n                      , in Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980, pp. 225\u2013235.","DOI":"10.1145\/800141.804670"},{"key":"R45","doi-asserted-by":"publisher","DOI":"10.1137\/0607057"},{"key":"R46","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"},{"key":"R47","unstructured":"C. H. Papadimitriou and S. Safra,\n                      The complexity of low-distortion embeddings between point sets\n                      , in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 112\u2013118."},{"key":"R48","doi-asserted-by":"publisher","DOI":"10.1137\/0601042"},{"key":"R49","doi-asserted-by":"crossref","unstructured":"W. Unger,\n                      The complexity of the approximation of the bandwidth problem\n                      , in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 82\u201391.","DOI":"10.1109\/SFCS.1998.743431"},{"key":"R50","unstructured":"R. C. Veltkamp and M. Hagedoorn,\n                      State of the Art in Shape Matching\n                      , Technical report UU-CS-1999-27, Utrecht University, Utrecht, The Netherlands, 1999."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/080712921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:31:17Z","timestamp":1787337077000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/080712921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,23]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1137\/080712921"],"URL":"https:\/\/doi.org\/10.1137\/080712921","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,23]]}}}