Groß, Martin, Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2012). Approximating Earliest Arrival Flows in Arbitrary Networks. In: Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 551-562. Berlin: Springer. ISBN 978-3-642-33090-2

Full text not available from this repository.

Item Type: Book Section, Proceedings Item or annotation in a legal commentary
Creators:
CreatorsEmailORCIDORCID Put Code
Groß, MartinUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Kappmeier, Jan-Philipp W.UNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Schmidt, Daniel R.UNSPECIFIEDorcid.org/0000-0001-7381-912XUNSPECIFIED
Schmidt, MelanieUNSPECIFIEDorcid.org/0000-0003-4856-3905UNSPECIFIED
URN: urn:nbn:de:hbz:38-117348
DOI: 10.1007/978-3-642-33090-2_48
Title of Book: Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings
Series Name: Lecture Notes in Computer Science
Volume: 7501
Page Range: pp. 551-562
Date: 2012
Publisher: Springer
Place of Publication: Berlin
ISBN: 978-3-642-33090-2
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: Yes
URI: http://kups.ub.uni-koeln.de/id/eprint/11734

Downloads

Downloads per month over past year

Altmetric

Export

Actions (login required)

View Item View Item