Reverse greedy is bad for k-center

  • D. Ellis Hershkowitz
  • , Gregory Kehne

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We show the reverse greedy algorithm is between a (2k−2)- and a 2k-approximation for k-center.

Original languageEnglish
Article number105941
JournalInformation Processing Letters
Volume158
DOIs
StatePublished - Jun 2020

Keywords

  • Approximation algorithms
  • Combinatorial optimization
  • Facility location
  • Reverse greedy

Fingerprint

Dive into the research topics of 'Reverse greedy is bad for k-center'. Together they form a unique fingerprint.

Cite this