approximation algorithms

Post on 09-Jan-2016

22 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

DESCRIPTION

Approximation Algorithms. Bin Packing. Definition. Theorem. An Easy Solution: First Fit. Asymptotic PTAS. Multiway Cut and k-Cut. Definition. Example. Can you prove it???. Approximation. Analysis. Minimum k-cut Problem. Example. Construct a Gomory-Hu Tree. - PowerPoint PPT Presentation

TRANSCRIPT

Approximation Algorithms

Bin Packing

My T. Thaimythai@cise.ufl.edu

2

Definition

My T. Thaimythai@cise.ufl.edu

3

Theorem

My T. Thaimythai@cise.ufl.edu

4

An Easy Solution: First Fit

My T. Thaimythai@cise.ufl.edu

5

Asymptotic PTAS

My T. Thaimythai@cise.ufl.edu

6

My T. Thaimythai@cise.ufl.edu

7

Multiway Cut and k-Cut

My T. Thaimythai@cise.ufl.edu

8

Definition

My T. Thaimythai@cise.ufl.edu

9

Example

My T. Thaimythai@cise.ufl.edu

10

My T. Thaimythai@cise.ufl.edu

11

Can you prove it???

Approximation

My T. Thaimythai@cise.ufl.edu

12

Analysis

My T. Thaimythai@cise.ufl.edu

13

Minimum k-cut Problem

My T. Thaimythai@cise.ufl.edu

14

Example

My T. Thaimythai@cise.ufl.edu

15

Construct a Gomory-Hu Tree

My T. Thaimythai@cise.ufl.edu

16

My T. Thaimythai@cise.ufl.edu

17

Properties of Gomory-Hu Tree wrt k-cut

My T. Thaimythai@cise.ufl.edu

18

Approximation Algorithm

My T. Thaimythai@cise.ufl.edu

19

Analysis

My T. Thaimythai@cise.ufl.edu

20

top related