Low distortion maps between point sets

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 272-280

  Kenyon, Claire ^a   Rabani, Yuval ^b,c   Sinclair, Alistair ^a,d  

^a ECOLE POLYTECHNIQUE   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c Department of Obstetrics Gynecology   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dynamic programming; Low distortion embeddings; Metric spaces; Shape matching

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPH THEORY; MATRIX ALGEBRA; OBJECT RECOGNITION; PARAMETER ESTIMATION; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING;

DYNAMIC PROGRAMMING (DP); LOW DISTORTION EMBEDDINGS; METRIC SPACES; SHAPE MATCING;

PROBLEM SOLVING;

EID: 4544263872     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007398     Document Type: Conference Paper

References (39)

1. T. Akutsu, K. Kanaya, A. Ohyama, and A. Fujiyama. Point matching under non-uniform distortions. Discrete Applied Mathematics, 127:5-21, 2003.
2. L. Babai, D.Y. Grigoryev, and D.M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In Proc. of the 14th Ann. ACM Symp. on Theory of Computing, 1982, pages 310-324.
3. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(4):509-522, 2002.
4. G. Blache, M. Karpinski, and J. Wirtgen. On approximation intractability of the bandwidth problem. ECCC technical report number TR98-014, 1998.
5. A. Blum, G. Konjevod, R. Ravi, and S. Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theoretical Computer Science, 235(1):25-42, 2000.
6. B. Chazelle, D. Liu, and A. Magen. Sublinear Geometric Algorithms. In Proc. of the 35th Ann. ACM Symp. on Theory of Computing, 2003, pages 531-540.
7. P.Z. Chinn, J. Chvatalova, A.K. Dewdney, and N.B. Gibbs. The bandwidth problem for graphs and matrices - A survey. Journal of Graph Theory, 6:223-254, 1982.
8. M. Deza and M. Laurent. Geometry of Cuts and Metrics. Springer, Algorithms and Combinatorics, Vol. 15, 1997.
9. J. Díaz, J. Petit, and M. Serna. A survey on graph layout problems. ACM Computing Surveys, to appear.
10. R. Downey. Parameterized complexity for the skeptic. In Proc. of the 18th IEEE Conference on Computational Complexity, 2003, pages 147-169.
11. R. Downey, M. Fellows, and U. Stege. Parameterized complexity: a framework for systematically confronting computational intractability. In: R. Graham. J. Kratochvil, J. Nesetril, and F. Roberts, eds. Contemporary Trends in Discrete Mathematics, AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 49, 1999, pages 49-99.
12. U. Feige. Approximating the bandwidth via volume respecting embeddings. Journal of Computer and Systems Sciences, 60(3):510-539, 2000.
13. U. Feige and R. Krauthgamer. Improved performance guarantees for bandwidth minimization heuristics. Unpublished manuscript, November 1998.
14. S. Fortin. The graph isomorphism problem. Technical Report 96-20, University of Alberta, Edomonton, Alberta, Canada, 1996.
15. M.R. Garey, R.L. Graham, D.S. Johnson, and D.E. Knuth. Complexity results for bandwidth minimization. SIAM J. Appl. Math., 34(3):477-495, 1978.
16. M.R. Garey and D.S. Johnson. Strong NP-completeness results: motivation, examples and implications. J. Assoc. Comput. Mach., 25:499-508, 1978.
17. A. Gupta. Improved bandwidth approximation for trees and chordal graphs. J. Algorithms, 40(1):24-36, 2001.
18. J. Haralambides, F. Makedon, and B. Monien. Bandwidth minimization: an approximation algorithm for caterpillars. Math. Systems Theory, 24(3):169-177, 1991.
19. F. Hoffmann, K. Kriegel, and C. Wenk. Matching 2D patterns of protein spots. In Proc. of the 14th Ann. ACM Symp. on Computational Geometry, 1998, pages 231-239.
20. J. Hopcroft and J. Wonk. A linear time algorithm for isomorphism of planar graphs. In Proc. of the 6th Ann. ACM Symp. on Theory of Computing, 1974, pages 172-184.
21. W-L. Hsu. O(M * N) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput. 24(3):411-439, 1995.
22. D. Huttenlocher, G. Klanderman, and W. Rucklidge. Comparing images using the Hausdorff distance. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(9):850-863, September 1993.
23. P. Indyk. Algorithmic aspects of geometric embeddings. FOCS '01 tutorial. Available at http://theory.les.mit.edu/~indyk/tut. html.
24. W.B. Johnson and J. Lindenstrauss (editors). Handbook of the Geometry of Banach Spaces. North-Holland, 2003.
25. M. Karpinski, J. Wirtgen, and A. Zelikovsky. An approximation algorithm for the bandwidth problem on dense graphs. ECCC technical report number TR97-017, 1997.
26. J. Kobler, U. Schöning, and J. Toran. The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science, Birkhauser, 1993.
27. D. Kratsch. Finding the minimum bandwidth of an interval graph. Information and Computation, 74:140-187, 1987.
28. N. Linial. Finite metric spaces - combinatorics, geometry and algorithms. In Proc. of the International Congress of Mathematicians III, Beijing, 2002, pages 573-586.
29. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
30. E. Luks. Isomorphism of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, 25:42-65, 1982.
31. A. Marcus and G. Tardos. Excluded permutation matrices and the Stanley-Wilf conjecture. Manuscript, November 2003. Available at http://www.renyi.hu/~tardos/submatrix.ps
32. J. Matoušek. Lectures on Discrete Geometry. Springer, Graduate Texts in Mathematics, Vol. 212, 2002.
33. G. Miller. Isomorphism testing for graphs of bounded genus. In Proc. of the 12th Ann. ACM Symp. on Theory of Computing, 1980, pages 225-235.
34. B. Monien. The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algeb. Discr. Meth., 7:505-512, 1986.
35. C.H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16(3):263-270, 1976.
36. C.H. Papadimitriou and S. Safra. The complexity of low-distortion embeddings between point sets. Preprint, February 2004. Available at http://www.cs.berkeley.edu/~christos
37. J.B. Saxe. Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algeb. Discr. Meth., 1:363-369, 1980.
38. W. Unger. The complexity of the approximation of the bandwidth problem. In Proc. of the 39th Ann. Symp. on Foundations of Computer Science, November 1998, pages 82-91.
39. R.C. Veltkamp and M. Hagedoorn. State of the Art in Shape Matching. Technical Report UU-CS-1999-27, U. Utrecht, 1999.