Worst case analysis of a class of set covering heuristics
In an earlier paper Chvatal provided the tight worst case bound of the set covering greedy heuristic. The authors considered a general class of greedy type set covering heuristics. Their worst case bounds are dominated by that of the greedy heuristic.
Gespeichert in:
| Veröffentlicht in: | Mathematical programming 1982-12, Vol.23 (1), p.170-180 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In an earlier paper Chvatal provided the tight worst case bound of the set covering greedy heuristic. The authors considered a general class of greedy type set covering heuristics. Their worst case bounds are dominated by that of the greedy heuristic. |
|---|---|
| ISSN: | 0025-5610 1436-4646 |
| DOI: | 10.1007/BF01583786 |