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]
@inproceedings{Vassilevska08,
title = {Nondecreasing paths in a weighted graph or: how to optimally read a train schedule},
author = {Virginia Vassilevska},
year = {2008},
doi = {10.1145/1347082.1347133},
url = {http://doi.acm.org/10.1145/1347082.1347133},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Vassilevska08},
cites = {0},
citedby = {0},
pages = {465-472},
booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008},
editor = {Shang-Hua Teng},
publisher = {SIAM},
}