Recent developments in approximation algorithms for facility location and clustering problems

Hyung Chan An; Ola Svensson

doi:10.1007/978-981-10-6147-9_1

Recent developments in approximation algorithms for facility location and clustering problems

Hyung Chan An, Ola Svensson

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Chapter

8 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 language	English
Title of host publication	Combinatorial Optimization and Graph Algorithms
Subtitle of host publication	Communications of NII Shonan Meetings
Publisher	Springer Singapore
Pages	1-19
Number of pages	19
ISBN (Electronic)	9789811061479
ISBN (Print)	9789811061462
DOIs	https://doi.org/10.1007/978-981-10-6147-9_1
Publication status	Published - 2017 Oct 2

Bibliographical note

Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2017. All rights reserved.

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1007/978-981-10-6147-9_1

Cite this

@inbook{d2708ef396ca4d6296d37a572ccac9cf,

title = "Recent developments in approximation algorithms for facility location and clustering problems",

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.",

author = "An, {Hyung Chan} and Ola Svensson",

year = "2017",

month = oct,

day = "2",

doi = "10.1007/978-981-10-6147-9_1",

language = "English",

isbn = "9789811061462",

pages = "1--19",

booktitle = "Combinatorial Optimization and Graph Algorithms",

publisher = "Springer Singapore",

}

TY - CHAP

T1 - Recent developments in approximation algorithms for facility location and clustering problems

AU - An, Hyung Chan

AU - Svensson, Ola

PY - 2017/10/2

Y1 - 2017/10/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85042605640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042605640&partnerID=8YFLogxK

U2 - 10.1007/978-981-10-6147-9_1

DO - 10.1007/978-981-10-6147-9_1

M3 - Chapter

AN - SCOPUS:85042605640

SN - 9789811061462

SP - 1

EP - 19

BT - Combinatorial Optimization and Graph Algorithms

PB - Springer Singapore

ER -

Recent developments in approximation algorithms for facility location and clustering problems

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this