Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt. Approximating Earliest Arrival Flows in Arbitrary Networks. In Leah Epstein, Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Volume 7501 of Lecture Notes in Computer Science, pages 551-562, Springer, 2012. [doi]
@inproceedings{GrossKSS12,
title = {Approximating Earliest Arrival Flows in Arbitrary Networks},
author = {Martin Groß and Jan-Philipp W. Kappmeier and Daniel R. Schmidt and Melanie Schmidt},
year = {2012},
doi = {10.1007/978-3-642-33090-2_48},
url = {http://dx.doi.org/10.1007/978-3-642-33090-2_48},
researchr = {https://researchr.org/publication/GrossKSS12},
cites = {0},
citedby = {0},
pages = {551-562},
booktitle = {Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
editor = {Leah Epstein and Paolo Ferragina},
volume = {7501},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-33089-6},
}