@InProceedings{takaoka:OASIcs.ATMOS.2015.56,
author = {Takaoka, Tadao},
title = {{Single Source Shortest Paths for All Flows with Integer Costs}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {56--67},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.56},
URN = {urn:nbn:de:0030-drops-54611},
doi = {10.4230/OASIcs.ATMOS.2015.56},
annote = {Keywords: information sharing, shortest path problem for all flows, priority queue, limited edge cost, transportation network}
}