An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.

Binay Bhattacharya Yuya Higashikawa Tsunehiko Kameda Naoki Katoh

Published in: ISAAC (2018)

Keyphrases

dynamic programming
cost function
computational complexity
shortest path problem
np hard
worst case
optimal solution
interval data
k means
linear programming
objective function
energy function
combinatorial optimization
convex hull
lagrangian relaxation