Polynomial-Time Approximation Schemes for Shortest Path with Alternatives

DOI10.1007/978-3-642-33090-2_65zbMath1365.68472OpenAlexW41339740MaRDI QIDQ2912890

Tim Nonner

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_65

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Fractional programming (90C32) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Arrival time dependent routing policies in public transport

This page was built for publication: Polynomial-Time Approximation Schemes for Shortest Path with Alternatives