Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡

First Page		Document Content
Date: 2011-10-04 12:29:59 Approximation 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 List Source URL: www.cs.technion.ac.il Download Document from Source Website File Size: 230,50 KB Share Document on Facebook

	Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer School DocID: 1vk0H - View Document
	Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary DocID: 1v7gN - View Document
	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 1uKug - View Document
	Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗ DocID: 1uqiK - View Document
	Parameterized complexity of even/odd subgraph problems DocID: 1up1m - View Document