{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:30:25Z","timestamp":1743147025684,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-97-7752-5_16","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:06:34Z","timestamp":1735380394000},"page":"199-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Facility Leasing Problem with\u00a0Penalties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9009-7429","authenticated-orcid":false,"given":"Baoyi","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8610-2769","authenticated-orcid":false,"given":"Lu","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9925-2316","authenticated-orcid":false,"given":"Sai","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6536-0328","authenticated-orcid":false,"given":"Lili","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Proceedings of the International Integer Programming and Combinatorial Optimization Conference, pp. 424\u2013438 (2007)","DOI":"10.1007\/978-3-540-72792-7_32"},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"key":"16_CR3","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Ji, S., Wu, C., Xu, Y., Yang, Y.: An approximation algorithm for diversity-aware fair $$k$$-supplier problem. Theor. Comput. Sci. 114305 (2023)","DOI":"10.1016\/j.tcs.2023.114305"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Xu, D., Xu, Y., Zhang, Y.: Parameterized approximation algorithms for sum of radii clustering and variants. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 18, pp. 20666\u201320673 (2024)","DOI":"10.1609\/aaai.v38i18.30053"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63, 191\u2013200 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-022-01195-3","volume":"87","author":"L Han","year":"2023","unstructured":"Han, L., Xu, D., Xu, Y., Yang, P.: Approximation algorithms for the individually fair $$k$$-center with outliers. J. Global Optim. 87(2), 603\u2013618 (2023)","journal-title":"J. Global Optim."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"issue":"6","key":"16_CR10","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9(4), 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Li, S.: A $$1.488$$ approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222, 45\u201358 (2013)","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 901\u2013910 (2013)","DOI":"10.1145\/2488608.2488723"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear\/submodular penalty. In: Proceedings of the International Computing and Combinatorics Conference, pp. 292\u2013303 (2013)","DOI":"10.1007\/978-3-642-38768-5_27"},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.26599\/TST.2023.9010152","volume":"29","author":"H Luo","year":"2024","unstructured":"Luo, H., Han, L., Shuai, T., Wang, F.: Approximation and heuristic algorithms for the priority facility location problem with outliers. Tsinghua Sci. Technol. 29(6), 1694\u20131702 (2024)","journal-title":"Tsinghua Sci. Technol."},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.disopt.2013.10.001","volume":"10","author":"C Nagarajan","year":"2013","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Discret. Optim. 10(4), 361\u2013370 (2013)","journal-title":"Discret. Optim."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10898-014-0251-6","volume":"64","author":"F Wang","year":"2016","unstructured":"Wang, F., Xu, D., Wu, C.: Combinatorial approximation algorithms for the robust facility location problem with penalties. J. Global Optim. 64, 483\u2013496 (2016)","journal-title":"J. Global Optim."},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf. Process. Lett. 94(3), 119\u2013123 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G Xu","year":"2009","unstructured":"Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17(4), 424\u2013436 (2009)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s00453-023-01158-4","volume":"86","author":"Y Xu","year":"2024","unstructured":"Xu, Y., Chau, V., Wu, C., Zhang, Y., Zissimopoulos, V., Zou, Y.: A semi brute-force search approach for (balanced) clustering. Algorithmica 86(1), 130\u2013146 (2024)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7752-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:23:58Z","timestamp":1739305438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}