"Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree ..."

Magnús M. Halldórsson, Jaikumar Radhakrishnan (1997)

> Home

Details and statistics

DOI: 10.1007/BF02523693

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/HalldorssonR97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/HalldorssonR97
Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18(1): 145-163 (1997)

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.