Random-Facet and Random-Bland require subexponential time even for shortest paths.

Oliver Friedmann Thomas Dueholm Hansen Uri Zwick

Published in: CoRR (2014)

Keyphrases

shortest path
road network
shortest path problem
query processing
wireless sensor networks
shortest path algorithm