The algebraic Monge property and path problems

  title={The algebraic Monge property and path problems},
  author={Wolfgang W. Bein and Peter Brucker and Lawrence L. Larmore and James K. Park},
  journal={Discrete Applied Mathematics},
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… CONTINUE READING