1
vote
Derandomization of vertex cover algorithm
Here are two possible derandomizations of the algorithm, with some caveats.
One possible derandomized algorithm
compute an optimal fractional solution $x^*$ to the standard linear-program (LP) ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
approximation × 605algorithms × 240
graphs × 105
complexity-theory × 103
optimization × 74
np-hard × 46
algorithm-analysis × 44
np-complete × 42
greedy-algorithms × 31
set-cover × 29
traveling-salesman × 28
reference-request × 21
randomized-algorithms × 20
reductions × 18
linear-programming × 18
scheduling × 15
terminology × 14
computational-geometry × 14
polynomial-time × 14
knapsack-problems × 14
heuristics × 13
vertex-cover × 13
time-complexity × 12
combinatorics × 12
complexity-classes × 12