A near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size

A near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size

We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the i[superscript th] neighbor of v. Letting VCopt(G) denote the m...

Full description

Bibliographic Details
Main Authors: Onak, Krzysztof, Ron, Dana, Rosen, Michal, Rubinfeld, Ronitt
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2012
Online Access:http://hdl.handle.net/1721.1/72545
https://orcid.org/0000-0002-4353-7639

Internet

http://hdl.handle.net/1721.1/72545
https://orcid.org/0000-0002-4353-7639

Similar Items