|
gptkb:Bin_Packing
|
1.7 (First Fit Decreasing)
|
|
gptkb:MAX-SAT
|
7/8 for general MAX-SAT
|
|
gptkb:Charikar's_algorithm_for_densest_subgraph
|
1
|
|
gptkb:Bin_Packing
|
1.22 (Best Known Polynomial Time)
|
|
gptkb:Set_Cover
|
ln(n)
|
|
gptkb:maximum_independent_set_(optimization_version)
|
hard to approximate
|
|
gptkb:Set_Covering_Problem
|
ln(n)
|
|
gptkb:Christofides_algorithm
|
1.5
|
|
gptkb:Vertex_Cover
|
2
|
|
gptkb:unweighted_set_cover_problem
|
O(log n)
|
|
gptkb:Maximum_cut_problem
|
0.878
|
|
gptkb:Max-Cut_problem
|
0.878 (Goemans–Williamson algorithm)
|
|
gptkb:Max-Cut
|
0.878
|
|
gptkb:MAX-3SAT
|
7/8
|
|
gptkb:Traveling_Salesman_Problem_(optimization_version)
|
Christofides' algorithm guarantees 1.5 approximation for metric TSP
|
|
gptkb:Bin_Packing_Problem
|
1.7 (First Fit Decreasing)
|
|
gptkb:MAX-CUT_problem
|
0.878
|
|
gptkb:vertex_cover_problem_(optimization_version)
|
2
|
|
gptkb:Geometric_Approximation_Algorithms
|
Depends on Problem
|
|
gptkb:Max_Cut
|
0.878
|