First Page | Document Content | |
---|---|---|
Solutions for Homework #2 in Design and Analysis of Algorithms Question 1 Recall that for a set S we let bi (S) denote the number of elements in S that were first covered by P Si (the ith set selected by the greedy algorDocument is deleted from original location. Download Document from Web Archive |