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 (Author), Ron, Dana (Author), Rosen, Michal (Author), Rubinfeld, Ronitt (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2012-09-06T15:52:46Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items