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.
|Title of host publication||Combinatorial Optimization and Graph Algorithms|
|Subtitle of host publication||Communications of NII Shonan Meetings|
|Number of pages||19|
|Publication status||Published - 2017 Oct 2|
Bibliographical notePublisher Copyright:
© Springer Nature Singapore Pte Ltd. 2017. All rights reserved.
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Economics, Econometrics and Finance(all)
- Business, Management and Accounting(all)