{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:45:04Z","timestamp":1757310304818,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T00:00:00Z","timestamp":1567036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T00:00:00Z","timestamp":1567036800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1615845","CCF-1318996"],"award-info":[{"award-number":["CCF-1615845","CCF-1318996"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00454-019-00127-5","type":"journal-article","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T16:04:29Z","timestamp":1567094669000},"page":"768-798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Capacitated Covering Problems in Geometric Spaces"],"prefix":"10.1007","volume":"63","author":[{"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmay","family":"Inamdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kasturi","family":"Varadarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,29]]},"reference":[{"key":"127_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Chakaravarthy, V.T., Gupta, N., Sabharwal, Y., Sharma, S., Thakral, S.: Replica placement on bounded treewidth graphs. In: Algorithms and Data Structures: 15th International Symposium (WADS 2017). Lecture Notes in Computer Science, vol. 10389, pp. 13\u201324. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-62127-2_2"},{"issue":"1\u20132","key":"127_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-014-0857-y","volume":"154","author":"H-C An","year":"2015","unstructured":"An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated $k$-center. Math. Program. 154(1\u20132), 29\u201353 (2015)","journal-title":"Math. Program."},{"key":"127_CR3","doi-asserted-by":"crossref","unstructured":"An, H.-C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), pp. 256\u2013265. IEEE Computer Society, Los Alamitos (2014)","DOI":"10.1109\/FOCS.2014.35"},{"issue":"7","key":"127_CR4","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size $\\epsilon $-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"127_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"127_CR6","doi-asserted-by":"crossref","unstructured":"Becker, A.: Capacitated dominating set on planar graphs. In: Approximation and Online Algorithms: 15th International Workshop (WAOA 2017), pp. 1\u201316. (2017)","DOI":"10.1007\/978-3-319-89441-6_1"},{"issue":"2","key":"127_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-011-9591-5","volume":"64","author":"P Berman","year":"2012","unstructured":"Berman, P., Karpinski, M., Lingas, A.: Exact and approximation algorithms for geometric and capacitated set cover problems. Algorithmica 64(2), 295\u2013310 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"127_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00453-012-9739-y","volume":"69","author":"P Bose","year":"2014","unstructured":"Bose, P., Carmi, P., Damian, M., Flatland, R.Y., Katz, M.J., Maheshwari, A.: Switching to directional antennas with constant increase in radius and hop distance. Algorithmica 69(2), 397\u2013409 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"127_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"127_CR10","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E., K\u00f6nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1576\u20131585. ACM, New York (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"2","key":"127_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1137\/S0097539703422479","volume":"36","author":"J Chuzhoy","year":"2006","unstructured":"Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM J. Comput. 36(2), 498\u2013515 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"127_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"127_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., Hajiaghayi, M., Khuller, S.: LP rounding for $k$-centers with non-uniform hard capacities. In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012), pp. 273\u2013282. IEEE Computer Society, Los Alamitos (2012)","DOI":"10.1109\/FOCS.2012.63"},{"key":"127_CR14","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the 2014 ACM Symposium on Theory of Computing (STOC 2014), pp. 624\u2013633. ACM, New York (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"1","key":"127_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jcss.2005.06.004","volume":"72","author":"R Gandhi","year":"2006","unstructured":"Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Aravind, S.: An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1), 16\u201333 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"127_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2014.01.026","volume":"527","author":"T Ghasemi","year":"2014","unstructured":"Ghasemi, T., Razzazi, M.: A PTAS for the cardinality constrained covering with unit balls. Theor. Comput. Sci. 527, 50\u201360 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"127_CR17","unstructured":"Govindarajan, S., Raman, R., Ray, S., Roy, A.B.: Packing and covering with non-piercing regions. In: 24th Annual European Symposium on Algorithms (ESA 2016). LIPIcs. Leibniz International Proceedings in Informatics, vol. 57, pp. 47:1\u201347:17. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016)"},{"issue":"1","key":"127_CR18","first-page":"65","volume":"3","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Lee, M.: Weighted geometric set cover problems revisited. J. Comput. Geom. 3(1), 65\u201385 (2012)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"127_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"127_CR20","doi-asserted-by":"crossref","unstructured":"Kao, M.-J.: Iterative partial rounding for vertex cover with hard capacities. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2638\u20132653. SIAM, Philadelphia (2017)","DOI":"10.1137\/1.9781611974782.174"},{"issue":"3","key":"127_CR21","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated ${K}$-center problem. SIAM J. Discrete Math. 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20132","key":"127_CR22","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. Math. Program. 131(1\u20132), 365\u2013379 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"127_CR23","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"127_CR24","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated $k$-median beyond the natural LP relaxation. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 696\u2013707. SIAM, Philadelphia (2015)","DOI":"10.1137\/1.9781611973730.47"},{"issue":"2","key":"127_CR25","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1997.0922","volume":"27","author":"R Lupton","year":"1998","unstructured":"Lupton, R., Maley, F.M., Young, N.E.: Data collection for the sloan digital sky survey\u2014a network-flow heuristic. J. Algorithms 27(2), 339\u2013356 (1998)","journal-title":"J. Algorithms"},{"key":"127_CR26","doi-asserted-by":"crossref","unstructured":"Mahdian, M., P\u00e1l, M.: Universal facility location. In: European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 2832, pp. 409\u2013421. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39658-1_38"},{"issue":"4","key":"127_CR27","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"NH Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete Comput. Geom. 44(4), 883\u2013895 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"127_CR28","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9., Wexler, T.: Facility location with nonuniform hard capacities. In: 42nd IEEE Symposium on Foundations of Computer Science, pp. 329\u2013338. IEEE Computer Society, Los Alamitos (2001)","DOI":"10.1109\/SFCS.2001.959907"},{"key":"127_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Comput. Complex. 4, 133\u2013157 (1994)","journal-title":"Comput. Complex."},{"key":"127_CR30","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.R.: Weighted geometric set cover via quasi-uniform sampling. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 641\u2013647. ACM, New York (2010)","DOI":"10.1145\/1806689.1806777"},{"issue":"4","key":"127_CR31","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"127_CR32","doi-asserted-by":"crossref","unstructured":"Wong, S.C.: Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2626\u20132637. SIAM, Philadelphia (2017)","DOI":"10.1137\/1.9781611974782.173"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00127-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00127-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00127-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:18:15Z","timestamp":1600251495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00127-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,29]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["127"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00127-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2019,8,29]]},"assertion":[{"value":"25 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}