1
Though unrelated, this lecture note contains a potential function based neat proof of the $O(\log k)$-approximation.
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
approximation-algorithms × 436ds.algorithms × 147
approximation-hardness × 83
cc.complexity-theory × 76
graph-theory × 65
graph-algorithms × 64
reference-request × 61
optimization × 46
np-hardness × 39
linear-programming × 27
set-cover × 23
randomized-algorithms × 19
co.combinatorics × 18
approximation × 15
clustering × 14
machine-learning × 13
max-cut × 13
partition-problem × 11
submodularity × 11
cg.comp-geom × 10
counting-complexity × 10
packing × 10
complexity-classes × 9
graph-colouring × 9
tsp × 9