Reverse greedy is bad for k-center

•We show the reverse greedy algorithm is between a (2k−2)- and a 2k-approximation for k-center.•We introduce a novel potential function for the analysis of center problems.•We give a lower bound construction showing that reverse greedy on k-center gives an Ω(n) in general. We show the reverse greedy...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 158; p. 105941
Main Authors Hershkowitz, D. Ellis, Kehne, Gregory
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.2020
Subjects
Approximation algorithms
Combinatorial optimization
Facility location
Reverse greedy
Facility location
Approximation algorithms
Combinatorial optimization
Reverse greedy
Online AccessGet full text
ISSN0020-0190
1872-6119
1872-6119
DOI10.1016/j.ipl.2020.105941

Cover

More Information
Summary:•We show the reverse greedy algorithm is between a (2k−2)- and a 2k-approximation for k-center.•We introduce a novel potential function for the analysis of center problems.•We give a lower bound construction showing that reverse greedy on k-center gives an Ω(n) in general. We show the reverse greedy algorithm is between a (2k−2)- and a 2k-approximation for k-center.
ISSN:0020-0190
1872-6119
1872-6119
DOI:10.1016/j.ipl.2020.105941