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

Approximation algorithms for graph approximation problems | NobleID

v1

Approximation algorithms for graph approximation problems

Victor Il’ev, Svetlana Il’eva, A. A. Navrotskaya

VI

Victor Il’ev

NobleIDNI6P77W53R75S24

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.