{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:49:05Z","timestamp":1743086945210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-031-83438-7_10","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:44Z","timestamp":1738706204000},"page":"109-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multipacking in the Euclidean Metric Space"],"prefix":"10.1007","author":[{"given":"Arun Kumar","family":"Das","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sk Samim","family":"Islam","sequence":"additional","affiliation":[]},{"given":"Ritam Manna","family":"Mitra","sequence":"additional","affiliation":[]},{"given":"Bodhayan","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2009.04.004","volume":"37","author":"S Abravaya","year":"2010","unstructured":"Abravaya, S., Segal, M.: Maximizing the number of obnoxious facilities to locate within a bounded region. Comput. Oper. Res. 37(1), 163\u2013171 (2010)","journal-title":"Comput. Oper. Res."},{"key":"10_CR2","unstructured":"Beaudou, L., Brewster, R.C.: On the multipacking number of grid graphs. Discrete Math. Theor. Comput. Sci. 21(Graph Theory) (2019)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002240000113","volume":"32","author":"P Berman","year":"1999","unstructured":"Berman, P., Fujito, T.: On approximation properties of the independent set problem for low degree graphs. Theor. Comput. Syst. 32, 115\u2013132 (1999)","journal-title":"Theor. Comput. Syst."},{"key":"10_CR4","unstructured":"Bonnet, \u00c9., Bousquet, N., Thomass\u00e9, S., Watrigant, R.: When maximum stable set can be solved in fpt time. arXiv preprint arXiv:1909.08426 (2019)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.dam.2018.08.021","volume":"261","author":"RC Brewster","year":"2019","unstructured":"Brewster, R.C., MacGillivray, G., Yang, F.: Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261, 108\u2013118 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"10_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"133","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discret. Appl. Math. 133(1\u20133), 3\u201328 (2003)","journal-title":"Discret. Appl. Math."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial optimization: Packing and covering. SIAM (2001)","DOI":"10.1137\/1.9780898717105"},{"key":"10_CR8","unstructured":"Das, A.K., Das, S., Islam, S.S., Mitra, R.M., Roy, B.: Multipacking in euclidean plane. arXiv preprint arXiv:2411.12351 (2024)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Das, S., Foucaud, F., Islam, S.S., Mukherjee, J.: Relation between broadcast domination and multipacking numbers on chordal graphs. In: Conference on Algorithms and Discrete Applied Mathematics, pp. 297\u2013308. Springer (2023)","DOI":"10.1007\/978-3-031-25211-2_23"},{"key":"10_CR10","unstructured":"Das, S., Islam, S.S.: Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs. arXiv preprint arXiv:2308.04882 (2023)"},{"issue":"7","key":"10_CR11","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1057\/palgrave.jors.2600828","volume":"48","author":"M Daskin","year":"1997","unstructured":"Daskin, M.: Network and discrete location: models, algorithms and applications. J. Oper. Res. Soc. 48(7), 763\u2013764 (1997)","journal-title":"J. Oper. Res. Soc."},{"issue":"03","key":"10_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M De Berg","year":"2012","unstructured":"De Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geometry Appl. 22(03), 187\u2013205 (2012)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/05695558008974513","volume":"12","author":"Z Drezner","year":"1980","unstructured":"Drezner, Z., Wesolowsky, G.O.: A maximin location problem with maximum distance constraints. AIIE Trans. 12(3), 249\u2013252 (1980)","journal-title":"AIIE Trans."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Drezner, Z., Wesolowsky, G.O.: The location of an obnoxious facility with rectangular distances. J. Regional Sci. 23(2) (1983)","DOI":"10.1111\/j.1467-9787.1983.tb00800.x"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. Discrete Computat. Geom. 17, 263\u2013282 (1997)","journal-title":"Discrete Computat. Geom."},{"issue":"9","key":"10_CR16","doi-asserted-by":"publisher","first-page":"2651","DOI":"10.1007\/s00453-021-00828-5","volume":"83","author":"F Foucaud","year":"2021","unstructured":"Foucaud, F., Gras, B., Perez, A., Sikora, F.: On the complexity of broadcast domination and multipacking in digraphs. Algorithmica 83(9), 2651\u20132677 (2021)","journal-title":"Algorithmica"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"3183","DOI":"10.1007\/s00453-020-00721-7","volume":"82","author":"M Henzinger","year":"2020","unstructured":"Henzinger, M., Leniowski, D., Mathieu, C.: Dynamic clustering to minimize the sum of radii. Algorithmica 82, 3183\u20133194 (2020)","journal-title":"Algorithmica"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Osbild, R., Sagraloff, M.: Reliable and efficient computational geometry via controlled perturbation. In: International Colloquium on Automata, Languages, and Programming, pp. 299\u2013310. Springer (2006)","DOI":"10.1007\/11786986_27"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A Meir","year":"1975","unstructured":"Meir, A., Moon, J.: Relations between packing and covering numbers of a tree. Pac. J. Math. 61(1), 225\u2013233 (1975)","journal-title":"Pac. J. Math."},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/S0360-8352(00)00022-X","volume":"37","author":"E Melachrinoudis","year":"1999","unstructured":"Melachrinoudis, E.: Bicriteria location of a semi-obnoxious facility. Comput. Ind. Eng. 37(3), 581\u2013593 (1999)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.trd.2003.09.002","volume":"9","author":"J Rakas","year":"2004","unstructured":"Rakas, J., Teodorovi\u0107, D., Kim, T.: Multi-objective modeling for determining location of undesirable facilities. Transp. Res. Part D: Transp. Environ. 9(2), 125\u2013138 (2004)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.orl.2005.07.007","volume":"34","author":"JS Rodr\u00edguez","year":"2006","unstructured":"Rodr\u00edguez, J.S., Garc\u00eda, C.G., P\u00e9rez, J.M., Casermeiro, E.M.: A general model for the undesirable single facility location problem. Oper. Res. Lett. 34(4), 427\u2013436 (2006)","journal-title":"Oper. Res. Lett."},{"key":"10_CR23","unstructured":"Teshima, L.E.: Broadcasts and multipackings in graphs. Master\u2019s thesis, University of Victoria (2012)"},{"key":"10_CR24","unstructured":"Wolf, G.W.: Facility location: concepts, models, algorithms and case studies. series: Contributions to management science: edited by zanjirani farahani, reza and hekmatfar, masoud, heidelberg, germany, physica-verlag, 549 p. (2009). isbn 978-3-7908-2150-5 (hardprint), 978-3-7908-2151-2 (electronic) (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:47Z","timestamp":1738706207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbatore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}