We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend Monge-array results for two shortest path problems to a general algebraic setting, with values in an ordered commutative semigroup, if the semigroup operator is strictly compatible with the order relation. We show how our algorithms can be modified to solve bottleneck shortest path problems, even though strict compatibility does not hold in that case. For example, we give a linear time algorithm for the unrestricted shortest path bottleneck problem on n nodes, also O(kn) and O(n3/2 log5/2 n) time algorithms for the k-shortest path bottleneck problem. © 2004 Elsevier B.V. All rights reserved.
Bein, W., Brucker, P., Larmore, L. L., & Park, J. K. (2005). The algebraic Monge property and path problems. Discrete Applied Mathematics, 145(3), 455–464. https://doi.org/10.1016/j.dam.2004.06.001