On-line scheduling to minimize max flow time: an optimal preemptive algorithm.

Christoph Ambühl Monaldo Mastrolilli

Published in: Oper. Res. Lett. (2005)

Keyphrases

max flow
worst case
dynamic programming
optimal solution
objective function
competitive ratio
scheduling problem
energy function
segmentation algorithm
min cost
convergence rate
mutual information
lower bound
graph cuts
linear programming
scheduling algorithm
graph structure
np hard
k means