Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

info@nobleid.org

About Fund our work FAQ Developers Terms Policy Persistence & Resolver Service Policy

Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs | NobleID

v1

Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

Eran Halperin

EH

Eran Halperin

NobleIDNI0P15W96R08S65

Type:Journal Article

Claim Your Authorship

Sign in to see the full record

Creating an account is free.

Create an account

For data access, contact info@nobleid.org.