New complexity results for time-constrained dynamical optimal path problems

DOI10.7155/jgaa.00201zbMath1194.05149OpenAlexW2168458340MaRDI QIDQ3402377

Konrad Reif, Martin Brokate, Sebastian Kluge

Publication date: 4 February 2010

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223553

zbMATH Keywords

cost optimal paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Minimum cost paths over dynamic networks ⋮ Computation of the optimal value function in time-dependent networks

This page was built for publication: New complexity results for time-constrained dynamical optimal path problems