Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A near-optimal sublinear-time algorithm for approximating the minimum ..."

Krzysztof Onak et al. (2012)

> Home

Details and statistics

DOI: 10.1137/1.9781611973099.88

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/OnakRRR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/OnakRRR12
Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.