Nondecreasing paths in a weighted graph or: how to optimally read a train schedule

Virginia Vassilevska. Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 465-472, SIAM, 2008. [doi]

Abstract

Abstract is missing.