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

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

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

Identifier:nobleid.org/w1/20260515/4DF4CD14

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/4DF4CD14.svg?ark=w1%2F20260515%2F4DF4CD14)](https://nobleid.org/work/w1/20260515/4DF4CD14)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Ronitt Rubinfeld

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy Pricing