Skip to main content

New answers tagged

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) ...
Neal Young's user avatar

Top 50 recent answers are included