{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:51:08Z","timestamp":1787507468370,"version":"build-2736575974"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0325453"],"award-info":[{"award-number":["CCR-0325453"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0311333"],"award-info":[{"award-number":["CCR-0311333"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-98-1-0589"],"award-info":[{"award-number":["N00014-98-1-0589"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>\n                    We introduce a facility location problem with submodular facility cost functions, and give an\n                    <jats:italic>O<\/jats:italic>\n                    (log\n                    <jats:italic>n<\/jats:italic>\n                    ) approximation algorithm for it. Then we focus on a special case of submodular costs, called hierarchical facility costs, and give a (4.237 + \u03f5)-approximation algorithm using local search. The hierarchical facility costs model multilevel service installation. Shmoys et al. [2004] gave a constant factor approximation algorithm for a two-level version of the problem. Here we consider a multilevel problem, and give a constant factor approximation algorithm, independent of the number of levels, for the case of identical costs on all facilities.\n                  <\/jats:p>","DOI":"10.1145\/1721837.1721853","type":"journal-article","created":{"date-parts":[[2010,4,6]],"date-time":"2010-04-06T22:56:32Z","timestamp":1270594592000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Facility location with hierarchical facility costs"],"prefix":"10.1145","volume":"6","author":[{"given":"Zoya","family":"Svitkina","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, AB"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9VA","family":"Tardos","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,4,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398594"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Chudak F. A. 1998. Improved approximation algorithms for uncapitated facility location. In IPCO. 180--194.  Chudak F. A. 1998. Improved approximation algorithms for uncapitated facility location. In IPCO. 180--194.","DOI":"10.1007\/3-540-69346-7_14"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703405754"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 16th ACM Symposium on Discrete Algorithms. ACM","author":"Garg N."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0993"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10080"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 16th ACM Symposium on Discrete Algorithms. ACM","author":"Hayrapetyan A."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581035"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502096"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1100"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the European Symposium on Algorithms. 409--421","author":"Mahdian M."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 15th ACM Symposium on Discrete Algorithms. ACM","author":"Ravi R."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 15th ACM Symposium on Discrete Algorithms. ACM","author":"Shmoys D."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Sviridenko M. 2002. An improved approximation algorithm for the metric uncapacitated facility location problem. In IPCO. 240--257.   Sviridenko M. 2002. An improved approximation algorithm for the metric uncapacitated facility location problem. In IPCO. 240--257.","DOI":"10.1007\/3-540-47867-1_18"},{"key":"e_1_2_1_21_1","unstructured":"Vazirani V. V. 2001. Approximation algorithms. Springer-Verlag Berlin Germany.   Vazirani V. V. 2001. Approximation algorithms. Springer-Verlag Berlin Germany."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022630.1022640"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721853","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1721837.1721853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:23:38Z","timestamp":1750235018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1145\/1721837.1721853"],"URL":"https:\/\/doi.org\/10.1145\/1721837.1721853","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"2007-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}