Premium
The facility location problem with general cost functions
Author(s) -
Hajiaghayi M. T.,
Mahdian M.,
Mirrokni V. S.
Publication year - 2003
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10080
Subject(s) - facility location problem , 1 center problem , mathematical optimization , focus (optics) , computer science , greedy algorithm , function (biology) , approximation algorithm , mathematics , physics , evolutionary biology , optics , biology
In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated facility location problem. We analyze a natural greedy algorithm for this problem and show that its approximation factor is at most 1.861. We also consider several generalizations and variants of this problem. © 2003 Wiley Periodicals, Inc.