%0 Journal Article %1 NET:NET10080 %A Hajiaghayi, M. T. %A Mahdian, M. %A Mirrokni, V. S. %D 2003 %I Wiley Subscription Services, Inc., A Wiley Company %J Networks %K facility.location %N 1 %P 42--47 %R 10.1002/net.10080 %T The facility location problem with general cost functions %V 42 %X 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.

@article{NET:NET10080, abstract = {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.}, added-at = {2012-09-24T16:23:06.000+0200}, author = {Hajiaghayi, M. T. and Mahdian, M. and Mirrokni, V. S.}, biburl = {https://www.bibsonomy.org/bibtex/2aad7e9f971b253d29f61f968f194017f/ytyoun}, doi = {10.1002/net.10080}, interhash = {864e89854161e77154b33f235bd41a8c}, intrahash = {aad7e9f971b253d29f61f968f194017f}, issn = {1097-0037}, journal = {Networks}, keywords = {facility.location}, number = 1, pages = {42--47}, publisher = {Wiley Subscription Services, Inc., A Wiley Company}, timestamp = {2012-09-24T16:23:06.000+0200}, title = {The facility location problem with general cost functions}, volume = 42, year = 2003 }