Back to Results
First PageMeta Content
Combinatorial optimization / Linear programming relaxation / Maximum flow problem / Maximum cut / Linear programming / Cut / Candidate solution / Randomized algorithm / Max-flow min-cut theorem / Randomized rounding


CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,
Add to Reading List

Document Date: 2014-11-05 01:13:23

Open Document

File Size: 183,25 KB

Share Result on Facebook
UPDATE