Back to Results
First PageMeta Content
Scheduling / Operations research / NP-complete problems / Complexity classes / Combinatorial optimization / Makespan / Knapsack problem / NP / Algorithm / Vertex cover / Approximation algorithm / Job shop scheduling


11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing
Add to Reading List

Document Date: 2014-11-08 06:52:04


Open Document

File Size: 3,39 MB

Share Result on Facebook
UPDATE