Go to the corresponding OASIcs Volume Portal 
pdfformat: 

@InProceedings{takaoka:OASIcs:2015:5461, author = {Tadao Takaoka}, 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 = {5667}, series = {OpenAccess Series in Informatics (OASIcs)}, ISBN = {9783939897996}, ISSN = {21906807}, year = {2015}, volume = {48}, editor = {Giuseppe F. Italiano and Marie Schmidt}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5461}, URN = {urn:nbn:de:0030drops54611}, doi = {10.4230/OASIcs.ATMOS.2015.56}, annote = {Keywords: information sharing, shortest path problem for all flows, priority queue, limited edge cost, transportation network} }
Keywords:  information sharing, shortest path problem for all flows, priority queue, limited edge cost, transportation network  
Seminar:  15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)  
Issue Date:  2015  
Date of publication:  08.09.2015 