Randomized Algorithms (Spring 2010)/Randomized approximation algorithms: Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop |
imported>WikiSysop |
||
| Line 6: | Line 6: | ||
==== Scheduling ==== | ==== Scheduling ==== | ||
Scheduling is a class of problems. We consider a central problem in scheduling theory: the '''minimum makespan scheduling'''. | |||
==== Knapsack ==== | ==== Knapsack ==== | ||
Revision as of 07:29, 27 May 2010
Approximation Algorithms
Coping with the NP-hardness
Combinatorial approximation algorithms
Scheduling
Scheduling is a class of problems. We consider a central problem in scheduling theory: the minimum makespan scheduling.