Advertisement

Conclusion

  • Helmut A. SeddingEmail author
Chapter
  • 120 Downloads

Abstract

In this work, we find that optimizing walking time with time-dependent paths to moving destinations is a computationally challenging problem. In most cases, it turns out as NP-hard, and we find edge cases that are polynomial or permit fully polynomial time approximation. Nonetheless, it is possible to establish fast exact search algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020

Authors and Affiliations

  1. 1.Institute of Theoretical Computer ScienceUlm UniversityUlmGermany

Personalised recommendations