Abstract
We show the reverse greedy algorithm is between a (2k−2)- and a 2k-approximation for k-center.
| Original language | English |
|---|---|
| Article number | 105941 |
| Journal | Information Processing Letters |
| Volume | 158 |
| DOIs | |
| State | Published - Jun 2020 |
Keywords
- Approximation algorithms
- Combinatorial optimization
- Facility location
- Reverse greedy