Recent developments in approximation algorithms for facility location and clustering problems

Hyung Chan An, Ola Svensson

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

We survey approximation algorithms for facility location and clustering problems, focusing on the recent developments. In particular, we review two algorithmic methodologies that have successfully lead to the current best approximation guarantees known: local search and linear programming based methods.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Graph Algorithms
Subtitle of host publicationCommunications of NII Shonan Meetings
PublisherSpringer Singapore
Pages1-19
Number of pages19
ISBN (Electronic)9789811061479
ISBN (Print)9789811061462
DOIs
Publication statusPublished - 2017 Oct 2

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)
  • Economics, Econometrics and Finance(all)
  • Business, Management and Accounting(all)

Fingerprint Dive into the research topics of 'Recent developments in approximation algorithms for facility location and clustering problems'. Together they form a unique fingerprint.

  • Cite this

    An, H. C., & Svensson, O. (2017). Recent developments in approximation algorithms for facility location and clustering problems. In Combinatorial Optimization and Graph Algorithms: Communications of NII Shonan Meetings (pp. 1-19). Springer Singapore. https://doi.org/10.1007/978-981-10-6147-9_1