# Design and Analysis of Algorithms

May 5th, 2015
Studypool Tutor
Price: \$10 USD

Tutor description

In the bin packing problem, the input consists of a sequence of items I = {1, . . . , n} where each item i has a size, which is a real number 0 ≤ ai ≤ 1. The goal is to “pack” the items in the smallest possible number of bins of unit size. Formally, the items should be partitioned in disjoint subsets (bins), such that the total size in each bin is at most.

Word Count: 734
Showing Page: 1/3
Design and Analysis of Algorithms510.6401 Design and Analysis of AlgorithmsJanuary 21, 2008Problem Set 1Due: February 4, 2008. 1. In the bin packing problem, the input consists of a sequence of items I = {1, . . . , n} where each item i has a size, which is a real number 0 ai 1. The goal is to pack the items in the smallest possible number of bins of unit size. Formally, the items should be partitioned in disjoint subsets (bins), such that the total size in each bin is at most 1. The rst t heuristic scans the items one by one, and each item is assigned to the rst bin that it can t in. Prove that rst-t is a 2-approximation algorithm for bin packing. Hint. Bound from below the number of bins used by an optimal solution; and bound from above the number of bins used by rst t, using the observation that nearly all bins are at least half-full. 2.

## Review from student

Studypool Student
" excellent work as always thanks for the help "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1827 tutors are online

### Other Documents

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors