Date: 2011-10-04 12:29:59Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory | | Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡Add to Reading ListSource URL: www.cs.technion.ac.ilDownload Document from Source Website File Size: 230,50 KBShare Document on Facebook
|