Probabilistic analysis of the greedy algorithm.
It is shown that the greedy algorithm in the average case (in some probabilistic model) finds almost minimum covers. It is shown also that in the average case the ratio of the size of minimum cover to the size of minimum fractional cover has logarithmic order in the size of the ground set.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2004-01-01
|
| Series: | Труды Института системного программирования РАН |
| Online Access: | https://www.ispras.ru/en/proceedings/isp_6_2004/isp_6_2004_101/ |