A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems.
Maurice CheungDavid B. ShmoysPublished in: APPROX-RANDOM (2011)
Keyphrases
- primal dual
- approximation algorithms
- linear programming
- computational complexity
- np hard
- optimal solution
- dynamic programming
- worst case
- min sum
- objective function
- convex optimization
- mathematical model
- linear program
- convergence rate
- single machine scheduling problem
- linear programming problems
- energy function
- convex hull
- branch and bound algorithm
- knapsack problem
- hybrid algorithm
- expectation maximization
- graphical models
- special case
- lower bound