A linear-processor polylog-time algorithm for shortest paths in planar graphs

Philip N. Klein Sairam Subramanian

Published in: FOCS (1993)

Keyphrases

shortest path
dynamic programming
optimal path
shortest path algorithm
objective function
np hard
expectation maximization
finding the shortest path
optimal solution
parameter estimation
metaheuristic
piecewise linear
minimum cost flow
strongly connected components