![Operations research / Approximation algorithms / Complexity classes / Polynomial-time approximation scheme / Job shop scheduling / Bin packing problem / Time complexity / Linear programming / David Shmoys / Theoretical computer science / Computational complexity theory / Applied mathematics Operations research / Approximation algorithms / Complexity classes / Polynomial-time approximation scheme / Job shop scheduling / Bin packing problem / Time complexity / Linear programming / David Shmoys / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/dc681e480f23ad42ebcaae0b2307b657.jpg) Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics | | A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the mAdd to Reading ListSource URL: page.math.tu-berlin.deDownload Document from Source Website File Size: 223,66 KBShare Document on Facebook
|