Approximation algorithms for facility location problems
David B. Shmoys, Éva Tardos, Karen Aardal
Abstract
Open-access reader
David B. Shmoys, Éva Tardos, Karen Aardal
Abstract
Open-access reader
One of the most flourishing areas of research in the design and analysis of approximation algorithms has been for facility location problems. In particular, for the metric case of two simple models, the uncapacitated facility location and the k-median problems, there are now a variety of techniques that yield constant performance guarantees. These methods
OpenAlex reports 506 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
One of the most flourishing areas of research in the design and analysis of approximation algorithms has been for facility location problems. In particular, for the metric case of two simple models, the uncapacitated facility location and the k-median problems, there are now a variety of techniques that yield constant performance guarantees. These methods
Key concepts: Computer science, Facility location problem, Algorithm, Approximation algorithm, Mathematics, Mathematical optimization