Computing a minimum-weight κ-link path in graphs with the concave monge property

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 405-411

  Schieber, Baruch ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

CONVEX POLYGON; DIRECTED ACYCLIC GRAPH (DAG); EDGE WEIGHTS; FOLLOWING PROBLEM; HUFFMAN CODE; INTERVAL GRAPH; MINIMUM WEIGHT; MONGE PROPERTY;

GRAPH THEORY;

EID: 0037784118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric Applications of a Matrix-Searching Algorithm, Algorithmica2 (1987), 195208.
2. A. Aggarwal and J. Park, Notes on Searching in Multidimensional Monotone Arrays, Proc. 29th IEEE Symp. on Foundations on Computer Science (1988), 497-512.
3. A. Aggarwal, B. Schieber and T. Tokuyama, Finding a minimum weight UT-link path in graphs with Monge property and applications, J. of Discrete and Computational Geometry 12 (1994), 263-280.
4. A. Aggarwal and T. Tokuyama, Consecutive Interval Query and Dynamic Programming on Intervals, Proc. 4th Int'l Symp. on Algorithms and Computation, Lecture Notes in Computer Science 762, Springer-Verlag (1993), 466-475.
5. T. Asano, Dynamic Programming on Intervals, Proc. 2nd Int'l Symp. on Algorithms, Lecture Notes in Computer Science 557, Springer-Verlag (1991), 199-207.
6. J. Boyce, D. Dobkin, R. Drysdale, and L. Guibas, Finding Extremal Polygons, SIAM J. on Computing 14 (1985), 134-147.
7. W. Bein, L. Laimore, and J. Park, The d-Edge Shortest-Path Problem for a Monge Graph, Preprint, 1992.
8. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Diameter, Width, Closest Line Pair, and Parametric Searching, Proc. 8th ACM Symp. on Computational Geometry (1992), 120-129.
9. R. Cole, Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms, J. ACM 34 (1987), 200-208.
10. M. Klawe, A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming, Technical Report 89-16, University of British Columbia, Vancouver, 1989.
11. L. Larmore and D. Hirschberg, Length-Limited Coding, Proc. 1st ACM-SIAMSymp. on Discrete Algorithms (1990), 310-318.
12. L. Larmore and T. Przytycka, Parallel Construction of Trees with Optimal Weighted Path Length, Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures (1991), 71-80.
13. N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. ACM 30 (1983), 852-865.
14. X. Wu, Optimal Quantization by Matrix Searching, J. of Algorithms 12 (1991), 663-673.
15. R. Wilber, The concave least weight subsequence problem revisited, J. of Algorithms 9 (1988), 418425.