原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
edure to also return the subset of S that sums to the value z*. Problems 35-1 Bin packing
You are given a set of n objects, where the size si of the ith object satisfies 0 < si < 1. Your goal is to pack all the objects into the minimum number of unit-size bins. Each bin can hold any subset of the objects whose total size does not exceed 1. a. Prove that the problem of determining the minimum number of bins required is NP-hard. (
Hint: Reduce from the subset-sum problem.) The first-fit heuristic takes each object in tu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea