View Document Preview and Link Document Date: 2008-09-30 05:19:33 Open Document File Size: 157,22 KB Share Result on Facebook
City San Mateo / San Francisco / Cambridge / Los Angeles / / Company Rockwell International / / / Facility Computer Science Department University of California / University of California / Harvard University / / IndustryTerm greedy solution / obvious algorithm / above algorithms / polynomial-time approximation algorithm / elegant polynomial-time approximation algorithm / good polynomial-time approximation algorithm / polynomialtime approximation algorithm / much better solutions / partial solution / greedy algorithm / genetic algorithms / real time / exponential-time algorithm / heuristic solution / search tree / above algorithm / partial solutions / job processing times / stochastic algorithms / search space / approximate solutions / previously-known algorithms / / Organization Computer Science Division / Center for Research / Harvard University / National Science Foundation / University of California / Berkeley / University of California / Los Angeles / Computer Science Department University / / Person Alex Fukunaga / Pierre Hasenfratz / Ken Boese / Morgan Kaufmann / Andrew Kahng / / / Position head / / ProvinceOrState California / Massachusetts / / Technology polynomial-time approximation algorithm / above algorithms / above algorithm / obvious algorithm / resulting algorithm / Solutions Both algorithms / polynomialtime approximation algorithm / good polynomial-time approximation algorithm / elegant polynomial-time approximation algorithm / The CKK algorithm / exponential-time algorithm / greedy algorithm / previously-known algorithms / CKK algorithm / two algorithms / / SocialTag 
F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning