Question
Consider the following Bin-Covering problem: Given n items with sizes a1, . . . , an (0, 1], maximize the number of bins opened
Consider the following Bin-Covering problem: Given n items with sizes a1, . . . , an ∈ (0, 1], maximize the number of bins opened so that each bin has items summing to at least 1. Give an asymptotic PTAS for this problem when restricted to instances in which item sizes are bounded below by c, for a fixed constant c > 0. (Hint: Use similar techniques as the PTAS algorithm for Bin-Packing problem)
Step by Step Solution
3.39 Rating (152 Votes )
There are 3 Steps involved in it
Step: 1
We are given n objects of sizes s1s2 sn such that 0 si s 1 and an unlimited supply of unit sized bin...
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Probability And Statistics For Engineering And The Sciences
Authors: Jay L. Devore
9th Edition
1305251806, 978-1305251809
