|
gptkb:MAX-CUT_problem
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkb:Node_Cover
|
2-approximation algorithm exists
|
|
gptkb:Max-Cut_problem
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkb:Vertex_cover_problem
|
2-approximation exists
|
|
gptkb:Max-Cut
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkb:Maximum_cut_problem
|
gptkb:Goemans–Williamson_algorithm
|
|
gptkb:Bin_Packing_Problem
|
First Fit
|
|
gptkb:unweighted_set_cover_problem
|
greedy algorithm
|
|
gptkb:Bin_Packing_Problem
|
Next Fit
|
|
gptkb:vertex_cover_problem
|
2-approximation algorithm exists
|
|
gptkb:Vertex_Cover
|
2-approximation algorithm exists
|
|
gptkb:Bin_Packing_Problem
|
Best Fit Decreasing
|
|
gptkb:Set_Covering_Problem
|
gptkb:Greedy_Algorithm
|
|
gptkb:Bin_Packing_Problem
|
First Fit Decreasing
|
|
gptkb:graph_coloring_(optimization_version)
|
greedy coloring
|
|
gptkb:Bin_Packing_Problem
|
Best Fit
|
|
gptkb:set_cover_problem_(optimization_version)
|
greedy algorithm
|
|
gptkb:MAX-3SAT
|
random assignment achieves 7/8 ratio
|