{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:53:15Z","timestamp":1777398795098,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031221040","type":"print"},{"value":"9783031221057","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_49","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"549-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Capacitated Facility Location with\u00a0Outliers\/Penalties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8742-8939","authenticated-orcid":false,"given":"Rajni","family":"Dabas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neelima","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"K Aardal","year":"2015","unstructured":"Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated k-facility location problems. EJOR 242(2), 358\u2013368 (2015)","journal-title":"EJOR"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-13036-6_12","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Aggarwal","year":"2010","unstructured":"Aggarwal, A., et al.: A 3-approximation for facility location with uniform capacities. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 149\u2013162. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_12"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: FOCS, pp. 256\u2013265 (2014)","DOI":"10.1109\/FOCS.2014.35"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: ESA, pp. 33\u2013144 (2012)","DOI":"10.1007\/978-3-642-33090-2_13"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated k-median problems. In: SODA, pp. 722\u2013736 (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem (extended abstract). In: STOC, pp. 1\u201310 (1999)","DOI":"10.1145\/301250.301257"},{"key":"49_CR7","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651 (2001)"},{"key":"49_CR8","unstructured":"Cygan, M., Kociumaka, T.: Constant factor approximation for capacitated k-center with outliers. In: STACS, pp. 251\u2013262 (2014)"},{"key":"49_CR9","unstructured":"Dabas, R., Gupta, N.: Uniform capacitated facility location problems with penalties\/outliers (2020). https:\/\/arxiv.org\/abs\/2012.07135"},{"key":"49_CR10","unstructured":"Dabas, R., Gupta, N.: Locating charging stations: connected, capacitated and prize- collecting (2022). https:\/\/arxiv.org\/abs\/2202.06262"},{"key":"49_CR11","unstructured":"Demirci, G., Li, S.: Constant approximation for capacitated k-median with (1+epsilon)-capacity violation. In: ICALP 2016, pp. 73:1\u201373:14 (2016)"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Khodamoradi, K., Rezapour, M., Salavatipour, M.R.: Approximation schemes for clustering with outliers. ACM Trans. Algorithms 15(2), 26:1\u201326:26 (2019)","DOI":"10.1145\/3301446"},{"key":"49_CR13","unstructured":"Grover, S., Gupta, N., Khuller, S., Pancholi, A.: Constant factor approximation algorithm for uniform hard capacitated knapsack median problem. In: FSTTCS, pp. 23:1\u201323:22 (2018)"},{"key":"49_CR14","unstructured":"Gupta, N., Gupta, S.: Approximation algorithms for capacitated facility location problem with penalties (2014). http:\/\/arxiv.org\/abs\/1408.4944"},{"issue":"4","key":"49_CR15","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00453-011-9547-9","volume":"63","author":"M Hajiaghayi","year":"2012","unstructured":"Hajiaghayi, M., Khandekar, R., Kortsarz, G.: Local search algorithms for the red-blue median problem. Algorithmica 63(4), 795\u2013814 (2012)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"49_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0380-8","volume":"131","author":"R Levi","year":"2012","unstructured":"Levi, R., Shmoys, D.B., Swamy, C.: LP-based approximation algorithms for capacitated facility location. J. Math. Programm. 131(1\u20132), 365\u2013379 (2012)","journal-title":"J. Math. Programm."},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Li, S.: Approximating capacitated $$k$$-median with (1 + $$\\epsilon $$)$$k$$ open facilities. In: SODA, pp. 786\u2013796 (2016)","DOI":"10.1137\/1.9781611974331.ch56"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"1","key":"49_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s10878-016-0080-2","volume":"36","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Xu, D., Du, D., Wu, C.: An approximation algorithm for k-facility location problem with linear penalties using local search scheme. J. Comb. Optim. 36(1), 264\u2013279 (2018)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:06:27Z","timestamp":1680213987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}