Approximating Earliest Arrival Flows in Arbitrary Networks

DOI10.1007/978-3-642-33090-2_48zbMath1365.90032OpenAlexW154560358MaRDI QIDQ2912873

Jan-Philipp W. Kappmeier, Martin Groß, Daniel R. Schmidt, Melanie Schmidt

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_48

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items

Evacuation planning by earliest arrival contraflow, Continuous dynamic contraflow approach for evacuation planning, Efficient continuous contraflow algorithms for evacuation planning problems, Lexicographically optimal earliest arrival flows, Approximation algorithms for the generalized incremental knapsack problem, Unnamed Item