240 likes | 428 Views
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.
E N D
Approximation Algorithms Bin Packing
Definition My T. Thai mythai@cise.ufl.edu
Theorem My T. Thai mythai@cise.ufl.edu
An Easy Solution: First Fit My T. Thai mythai@cise.ufl.edu
Asymptotic PTAS My T. Thai mythai@cise.ufl.edu
My T. Thai mythai@cise.ufl.edu
My T. Thai mythai@cise.ufl.edu
Multiway Cut and k-Cut My T. Thai mythai@cise.ufl.edu
Definition My T. Thai mythai@cise.ufl.edu
Example My T. Thai mythai@cise.ufl.edu
Can you prove it??? My T. Thai mythai@cise.ufl.edu
Approximation My T. Thai mythai@cise.ufl.edu
Analysis My T. Thai mythai@cise.ufl.edu
Minimum k-cut Problem My T. Thai mythai@cise.ufl.edu
Example My T. Thai mythai@cise.ufl.edu
Construct a Gomory-Hu Tree My T. Thai mythai@cise.ufl.edu
My T. Thai mythai@cise.ufl.edu
Properties of Gomory-Hu Tree wrt k-cut My T. Thai mythai@cise.ufl.edu
Approximation Algorithm My T. Thai mythai@cise.ufl.edu
Analysis My T. Thai mythai@cise.ufl.edu