Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing a minimum-weight k-link path in graphs with the concave Monge property
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line dynamic programming with applications to the prediction of RNA secondary structure
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Minimum Lk path partitioning-An illustration of the Monge property
Operations Research Letters
Improved complexity bounds for location problems on the real line
Operations Research Letters
Hi-index | 0.00 |
Following [KK89] we will say that an algorithm for finding the column minima of a matrix is ordered if the algorithm never evaluates the $(i,j)$ entry of the matrix until the minima of columns $1, 2, \ldots , i$ are known. This note presents an extremely simple linear time ordered algorithm for finding column minima in triangular totally monotone matrices. Analogous to [KK89] this immediately yields a linear time algorithm for the concave one-dimensional dynamic programming problem. Wilber [W88] gave the first linear time algorithm for the concave one-dimensional dynamic programming problem, but his algorithm was not ordered and hence could not be applied in some situations. Examples of these situations are given in [GP89] and [L89]. Galil and Park [GP89] and Larmore [L89] independently found quite different ordered linear time algorithms. All of these algorithms, and ours as well, rely on the original linear-time algorithm known as SMAWK for finding column minima in totally monotone matrices [AKMSW87]. The constant in our algorithm is essentially the same of that of the Galil-Park algorithm, and since our algorithm is so simple to program, we expect it to be the algorithm of choice in implementations.