Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 170-201

  Buss, Samuel R ^a   Yianilos, Peter N ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Princeton University   (United States)

Author keywords

Assignment problem; Bipartite weighted matching; Computational geometry; Concave penalty function; Convexity; Linear time; Monge property; Quadrangle inequality; String comparison

Indexed keywords

EID: 0001627148     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794267243     Document Type: Article

References (27)

1. A. AGGARWAL, A. BAR-NOY, S. KHULLER, D. KRAVETS, AND B. SCHIEBER, Efficient minimum cost matching using quadrangle inequality, in Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 583-592.
2. A. AGGARWAL AND M. KLAWE, Applications of generalized matrix searching to geometric algorithms, Discrete Appl. Math., 27 (1990), pp. 3-23.
3. A. AGGARWAL, M. KLAWE, S. MORAN, P. SHOR, AND R. WILBER, Geometric applications of a matrix-searching algorithm, Algorithmica, 2 (1987), pp. 195-208.
4. A. AGGARWAL AND J. PARK, Notes on searching in multidimensional monotone arrays, in Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 497-512.
5. S. R. BUSS, K. G. KANZELBERGER, D. ROBINSON, AND P. N. YIANILOS, Solving the Minimum-cost Matching Problem for Quasi-convex Tours: An Efficient ANSI-C Implementation, Tech. Report CS94-370, University of California, San Diego, 1994.
6. S. R. BUSS AND P. N. YIANILOS, A Bipartite Matching Approach to Approximate String Comparison and Search, Tech. Report, NEC Research Institute, Princeton, NJ, 1995.
7. D. EPPSTEIN, Sequence comparison with mixed convex and concave costs, J. Algorithms, 11 (1990), pp. 85-101.
8. Z. GALIL AND R. GIANCARLO, Speeding up dynamic programming with applications to molecular biology, Theoret. Comput. Sci., 64 (1989), pp. 107-118.
9. Z. GALIL AND K. PARK, A linear-time algorithm for concave one-dimensional dynamic programming, Inform. Process. Lett., 33 (1990), pp. 309-311.
10. P. GILMORE AND R. GOMORY, Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Oper. Res., 12 (1964), pp. 655-679.
11. X. HE, An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon, Inform. Process. Lett., 37 (1991), pp. 111-116.
12. D. S. HIRSCHBERG AND L. L. LARMORE, The least weight subsequence problem, SIAM J. Comput., 16 (1987), pp. 628-638.
13. A. J. HOFFMAN, On simple linear programming problems, in Convexity: Proceedings of the Seventh Symposium in Pure Mathematics of the AMS, V. Klee, ed., American Mathematical Society, Providence, RI, 1963, pp. 317-327.
14. R. M. KARP AND S.-Y. R. LI, Two special cases of the assignment problem, Discrete Math., 13 (1975), pp. 129-142.
15. M. M. KLAWE AND D. J. KLEITMAN, An almost linear time algorithm for generalized matrix searching, SIAM J. Discrete Math., 3 (1990), pp. 81-97.
16. D. KRAVETS AND J. K. PARK, Selection and sorting in totally monotone arrays, Math. Systems Theory, 24 (1991), pp. 201-220.
17. L. L. LARMORE AND B. SCHIEBER, On-line dynamic programming with applications to the prediction of RNA secondary structure, J. Algorithms, 12 (1991), pp. 490-515.
18. E. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
19. Y. MANSOUR, J. K. PARK, B. SCHIEBER, AND S. SEN, Improved selection in totally monotone arrays, Internat. J. Comput. Geom. Appl., 3 (1993), pp. 115-132.
20. O. MARCOTTE AND S. SURI, Fast matching algorithms for points on a polygon, SIAM J. Comput., 20 (1991), pp. 405-422.
21. D. SANKOFF AND J. B. KRUSKAL, Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983.
22. P. M. VAIDYA, Geometry helps in matching, SIAM J. Comput., 18 (1989), pp. 1201-1225.
23. M. WERMAN, S. PELEG, R. MELTER, AND T. KONG, Bipartite graph matching for points on a line or a circle, J. Algorithms, 7 (1986), pp. 277-284.
24. R. WILBER, The concave least-weight subsequence problem revisited, J. Algorithms, 9 (1988), pp. 418-425.
25. F. F. YAO, Speed-up in dynamic programming, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 523-540.
26. P. N. YIANILOS, The Definition, Computation and Application of Symbol String Similarity Functions, Master's thesis, Emory University, Atlanta, GA, 1978.
27. P. N. YIANILOS AND S. R. BUSS, Associative memory circuit system and method, continuation-in-part, U.S. Patent 4490811, 1984.