A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size

Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size'. Together they form a unique fingerprint.

Mathematics