Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/algorithmica/HalldorssonR97, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/HalldorssonR97 / rank | |||
Normal rank | |||
Latest revision as of 08:44, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greed is good: Approximating independent sets in sparse and bounded-degree graphs |
scientific article |
Statements
Greed is good: Approximating independent sets in sparse and bounded-degree graphs (English)
0 references
20 July 1997
0 references
minimum-degree greedy algorithm
0 references
