{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:01:26Z","timestamp":1743040886666,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_39","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"463-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Neelima","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sapna","family":"Grover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajni","family":"Dabas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10107-012-0565-4","volume":"141","author":"A Aggarwal","year":"2012","unstructured":"Aggarwal, A., et al.: A 3-approximation algorithm for the facility location problem with uniform capacities. Math. Program. 141(1), 527\u2013547 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0565-4","journal-title":"Math. Program."},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-38016-7_21","volume-title":"Approximation and Online Algorithms","author":"S Ahmadian","year":"2013","unstructured":"Ahmadian, S., Swamy, C.: Improved approximation guarantees for lower-bounded facility location. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 257\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38016-7_21"},{"doi-asserted-by":"crossref","unstructured":"An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: FOCS, pp. 256\u2013265, October 2014","key":"39_CR3","DOI":"10.1109\/FOCS.2014.35"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-33090-2_13","volume-title":"Algorithms \u2013 ESA 2012","author":"M Bansal","year":"2012","unstructured":"Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 133\u2013144. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_13"},{"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 2015, pp. 722\u2013736 (2015)","key":"39_CR5","DOI":"10.1137\/1.9781611973730.49"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-48777-8_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"FA Chudak","year":"1999","unstructured":"Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 99\u2013113. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_8"},{"unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Approximating connected facility location with lower and upper bounds via LP rounding. In: SWAT 2016, pp. 1:1\u20131:14 (2016)","key":"39_CR7"},{"unstructured":"Grover, S., Gupta, N., Dabas, R.: First approximation for uniform lower and upper bounded facility location problem avoiding violation in lower bounds. CoRR abs\/2106.11372 (2021)","key":"39_CR8"},{"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":"39_CR9"},{"doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: FOCS, p. 603 (2000)","key":"39_CR10","DOI":"10.1109\/SFCS.2000.892328"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-58150-3_51","volume-title":"Computing and Combinatorics","author":"L Han","year":"2020","unstructured":"Han, L., Hao, C., Wu, C., Zhang, Z.: Approximation algorithms for the lower-bounded k-median and its generalizations. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 627\u2013639. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58150-3_51"},{"doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS, pp. 613\u2013623 (2000)","key":"39_CR12","DOI":"10.1109\/SFCS.2000.892329"},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Li, S.: On facility location with general lower bounds. In: SODA, pp. 2279\u20132290 (2019)","key":"39_CR14","DOI":"10.1137\/1.9781611975482.138"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/trsc.1050.0123","volume":"40","author":"A Lim","year":"2006","unstructured":"Lim, A., Wang, F., Xu, Z.: A transportation problem with minimum quantity commitment. Transp. Sci. 40, 117\u2013129 (2006)","journal-title":"Transp. Sci."},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-39658-1_38","volume-title":"Algorithms - ESA 2003","author":"M Mahdian","year":"2003","unstructured":"Mahdian, M., P\u00e1l, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409\u2013421. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_38"},{"doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS, pp. 329\u2013338 (2001)","key":"39_CR17","DOI":"10.1109\/SFCS.2001.959907"},{"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)","key":"39_CR18","DOI":"10.1145\/258533.258600"},{"key":"39_CR19","first-page":"1","volume":"6","author":"Z Svitkina","year":"2010","unstructured":"Svitkina, Z.: Lower-bounded facility location. ACM Trans. Algorithms 6, 1\u201316 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J Zhang","year":"2005","unstructured":"Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. J. Math. Oper. Res. 30, 389\u2013403 (2005)","journal-title":"J. Math. Oper. Res."}],"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-030-89543-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T10:01:45Z","timestamp":1725962505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","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":"56","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":"0","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":"43% - 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.1","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":"2.2","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)"}}]}}