NDLI: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Epstein, Leah Levin, Asaf
Copyright Year	2010
Abstract	We consider two well-known natural variants of bin packing and show that these packing problems admit asymptotic fully polynomial time approximation schemes (AFPTASs). In bin packing problems, a set of one-dimensional items of size at most 1 is to be assigned (packed) to subsets of sum at most 1 (bins). It has been known for a while that the most basic problem admits an AFPTAS. In this paper, we develop new methods that allow us to extend this result to other variants of bin packing consisting of a family of two-parameter bin packing problems. We demonstrate the use of our methods by designing AFPTASs for the following problems. The first problem is bin packing with cardinality constraints, where a parameter k is given such that a bin may contain up to k items. The goal is to minimize the number of bins used. The second problem is bin packing with rejection, where every item has a rejection penalty associated with it. An item needs to be either packed to a bin or rejected, and the goal is to minimize the number of bins used and the total rejection penalty of unpacked items. This resolves the complexity of two important variants of the bin packing problem. Our approximation schemes use a novel method for packing the small items. This new method is the core of the improved running times of our schemes over the running times of the previous results, which are only asymptotic polynomial time approximationschemes.
Starting Page	3121
Ending Page	3145
Page Count	25
File Format	PDF
ISSN	10526234
DOI	10.1137/090767613
e-ISSN	10957189
Journal	SIAM Journal on Optimization (SJOPE8)
Issue Number	6
Volume Number	20
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2010-10-19
Access Restriction	Subscribed
Subject Keyword	Analysis of algorithms and problem complexity worst case analysis approximation algorithm Approximation algorithms Analysis of algorithms bin packing
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Theoretical Computer Science Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in