Finding a minimum-weightk-link path in graphs with the concave Monge property and applications
- 1 September 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (3) , 263-280
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Consecutive interval query and dynamic programming on intervalsLecture Notes in Computer Science, 1993
- Optimal quantization by matrix searchingJournal of Algorithms, 1991
- On-line dynamic programming with applications to the prediction of RNA secondary structureJournal of Algorithms, 1991
- Dynamic programming on intervalsLecture Notes in Computer Science, 1991
- Finding least-weight subsequences with fewer processorsLecture Notes in Computer Science, 1990
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Finding Extremal PolygonsSIAM Journal on Computing, 1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983