'Inapproximability' presentation slideshows

Approximation Algorithms

976 views • 74 slides

Approximation Algorithms for Quickest Spanning Tree Problems

Approximation Algorithms for Quickest Spanning Tree Problems. Presenter: ??? ??? ??? ??? ??? . Author. Refael Hassin. Asaf Levin. Outline. Introduction A 2-approximation algorithm for the quickest radius spanning tree problem Inapproximability of the quickest radius spanning tree problem

857 views • 73 slides

Packing Rectangles into Bins

Packing Rectangles into Bins. Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM). Problem. Given: Collection of rectangles (by height, width) Goal : Pack in min # of unit square bins Rectangles parallel to bin edges Cannot be rotated. Rectangles. 4. 5. 3. 6. 1. 2. 6. 6.

769 views • 65 slides

74 views • 7 slides