{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:12:35Z","timestamp":1775229155257,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:00:00Z","timestamp":1327449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10898-012-9852-0","type":"journal-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T11:14:12Z","timestamp":1327403652000},"page":"1325-1334","source":"Crossref","is-referenced-by-count":7,"title":["A cross-monotonic cost-sharing scheme for the concave facility location game"],"prefix":"10.1007","volume":"56","author":[{"given":"Gaidi","family":"Li","sequence":"first","affiliation":[]},{"given":"Yu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Shu","sequence":"additional","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"9852_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10898-008-9381-z","volume":"45","author":"R. Blanquero","year":"2009","unstructured":"Blanquero R., Carrizosa E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45, 389\u2013402 (2009)","journal-title":"J. Glob. Optim."},{"key":"9852_CR2","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J. Byrka","year":"2010","unstructured":"Byrka J., Aardal K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39, 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"key":"9852_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10898-006-9051-y","volume":"37","author":"Z. Drezner","year":"2007","unstructured":"Drezner Z.: A general global optimization approach for solving location problems in the plane. J. Glob. Optim. 37, 305\u2013319 (2007)","journal-title":"J. Glob. Optim."},{"key":"9852_CR4","doi-asserted-by":"crossref","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica. doi: 10.1007\/s00453-011-9526-1","DOI":"10.1007\/s00453-011-9526-1"},{"key":"9852_CR5","doi-asserted-by":"crossref","unstructured":"Du, H., Wu, W., Lee, W., Liu, Q., Zhang, Z., Du, D.: On minimum submodular cover with submodular cost. J. Glob. Optim. doi: 10.1007\/s10898-010-9563-3","DOI":"10.1007\/s10898-010-9563-3"},{"key":"9852_CR6","unstructured":"Du, D., Graham, R. L., Pardalos, P.M., Wan, P., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of SODA, pp. 167\u2013175 (2008)"},{"key":"9852_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10589-009-9269-y","volume":"45","author":"D. Du","year":"2010","unstructured":"Du D., Wan P., Pardalos P.M., Wu W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45, 463\u2013474 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"9852_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0166-218X(02)00458-4","volume":"131","author":"L. Fleischer","year":"2003","unstructured":"Fleischer L., Iwata S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131, 311\u2013322 (2003)","journal-title":"Discret. Appl. Math."},{"key":"9852_CR9","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: Proceedings of SODA, pp. 649\u2013657 (1998)"},{"key":"9852_CR10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi M., Mahdian M., Mirrokni V.: The facility location problem with general cost functions. Networks 42, 42\u201347 (2003)","journal-title":"Networks"},{"key":"9852_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1361192.1361201","volume":"4","author":"N. Immorlica","year":"2008","unstructured":"Immorlica N., Mahdian M., Mirronki V.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4, 1\u201325 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9852_CR12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain K., Vazirani V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"9852_CR13","doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, Part II, pp. 77\u201388 (2011)","DOI":"10.1007\/978-3-642-22012-8_5"},{"key":"9852_CR14","doi-asserted-by":"crossref","unstructured":"Mettu, R., Plaxton, C.: The online median problem. In: Proceedings of FOCS, pp. 339\u2013348 (2000)","DOI":"10.1109\/SFCS.2000.892122"},{"key":"9852_CR15","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin H., Shenker S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theory 18, 511\u2013533 (2001)","journal-title":"Econ. Theory"},{"key":"9852_CR16","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceeding of FOCS, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"9852_CR17","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Du, D.: Network Design: Connectivity and Facilities Location. DIMACS vol. 40, American Mathematical Society (1998)","DOI":"10.1090\/dimacs\/040"},{"key":"9852_CR18","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceeding of STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"9852_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D. Xu","year":"2006","unstructured":"Xu D., Du D.: The k-level facility location game. Oper. Res. Lett. 34, 421\u2013426 (2006)","journal-title":"Oper. Res. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9852-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9852-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9852-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T05:48:11Z","timestamp":1742363291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9852-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,25]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9852"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9852-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,25]]}}}