Sciweavers

SODA
1997
ACM
114views Algorithms» more  SODA 1997»
14 years 1 months ago
Better Approximation Guarantees for Job-shop Scheduling
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv...