Login / Signup

An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures.

Frank BauernöppelAnil MaheshwariJörg-Rüdiger Sack
Published in: LATIN (2020)
Keyphrases
  • shortest path
  • lower bound
  • optimal solution
  • upper bound
  • nearest neighbor
  • road network
  • shortest path algorithm
  • np hard
  • finite number