'Minimum bin packing' diaporamas de présentation

Non-Approximability Results

Non-Approximability Results. Summary. Gap technique Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING The PCP theorem Application: Non-approximability of MAXIMUM 3-SAT. The Gap Technique. P 1 : NPO minimization problem (same for maximization) P 2 : NP-hard decision problem

326 views • 21 slides

Approximation Algorithms

497 views • 21 slides

Non-Approximability Results

Non-Approximability Results. Summary. Gap technique Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING The PCP theorem Application: Non-approximability of MAXIMUM 3-SAT. The Gap Technique. P 1 : NPO minimization problem (same for maximization) P 2 : NP-hard decision problem

215 views • 21 slides