Fast Algorithms with Algebraic Monge Properties

When restricted to cost arrays possessing the sum Monge property, many combinatorial optimization problems with sum objective functions become significantly easier to solve. The more general algebraic assignment and transportation problems are similarly easier to solve given cost arrays possessing the corresponding algebraic Monge property. We show that Monge-array results for two sum-of-edge-costs shortest-path problems can likewise be extended to a general algebraic setting, provided the problems' ordered commutative semigroup satisfies one additional restriction. In addition to this general result, we also show how our algorithms can be modified to solve certain bottleneck shortestpath problems, even though the ordered commutative semigroup naturally associated with bottleneck problems does not satisfy our additional restriction. We show how our bottleneck shortest-path techniques can be used to obtain fast algorithms for a variant of Hirschberg and Larmore's optimal paragraph formation problem, and a special case of the bottleneck traveling-salesman problem.

[1]  Rainer E. Burkard,et al.  Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..

[2]  Alok Aggarwal,et al.  Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.

[3]  Alok Aggarwal,et al.  Finding a minimum-weightk-link path in graphs with the concave Monge property and applications , 1994, Discret. Comput. Geom..

[4]  Pankaj K. Agarwal,et al.  Selection in Monotone Matrices and Computing kth Nearest Neighbors , 1994, J. Algorithms.

[5]  Baruch Schieber,et al.  On-line dynamic programming with applications to the prediction of RNA secondary structure , 1991, SODA '90.

[6]  Rainer E. Burkard,et al.  Combinatorial optimization in linearly ordered semimodules: A survey , 1982 .

[7]  Pier Giuseppe Rossi,et al.  Art , 2000, The Lancet.

[8]  Gerhard J. Woeginger,et al.  on the Recognition of Permuted Bottleneck Monge Matrices , 1995, Discret. Appl. Math..

[9]  Alok Aggarwal,et al.  Finding a minimum weight K-link path in graphs with Monge property and applications , 1993, SCG '93.

[10]  Robert E. Wilber.  The Concave Least-Weight Subsequence Problem Revisited , 1988, J. Algorithms.

[11]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[12]  Rainer E. Burkard,et al.  Efficiently solvable special cases of bottleneck travelling salesman problems , 1991, Discret. Appl. Math..

[13]  Lawrence L. Larmore,et al.  The least weight subsequence problem , 1987, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[15]  Pankaj K. Agarwal,et al.  Selection in Monotone Matrices and Computing kth Nearest Neighbors , 1994, SWAT.

[16]  Daniel S. Hirschberg,et al.  Improved Update/Query Algorithms for the Interval Valuation Problem , 1987, Inf. Process. Lett..

[17]  A. Hoffman.  ON SIMPLE LINEAR PROGRAMMING PROBLEMS , 2003 .