{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:04Z","timestamp":1759637944747},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_14","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"145-156","source":"Crossref","is-referenced-by-count":15,"title":["Weighted Geometric Set Multi-cover via Quasi-uniform Sampling"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-13036-6_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"D. Chakrabarty","year":"2010","unstructured":"Chakrabarty, D., Grant, E., K\u00f6nemann, J.: On Column-Restricted and Priority Covering Integer Programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 355\u2013368. Springer, Heidelberg (2010)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multi-cover problem in geometric settings. In: Symposium on Computational Geometry, pp. 341\u2013350 (2009)","DOI":"10.1145\/1542362.1542421"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: The geometry of scheduling. In: FOCS, pp. 407\u2013414 (2010)","DOI":"10.1109\/FOCS.2010.46"},{"issue":"4","key":"14_CR6","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 & Computational Geometry\u00a014(4), 463\u2013479 (1995)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete & Computational Geometry\u00a037(1), 43\u201358 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.R.: Epsilon nets and union complexity. In: Symposium on Computational Geometry, pp. 11\u201316 (2009)","DOI":"10.1145\/1542362.1542366"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size epsilon-nets for axis-parallel rectangles and boxes. In: STOC, pp. 639\u2013648 (2009)","DOI":"10.1145\/1536414.1536501"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.: Weighted geometric set cover via quasi-uniform sampling. In: STOC, pp. 641\u2013648 (2010)","DOI":"10.1145\/1806689.1806777"},{"key":"14_CR11","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: SODA, pp. 1576\u20131585 (2012)","DOI":"10.1137\/1.9781611973099.125"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The probabilistic method. John Wiley (2008)","DOI":"10.1002\/9780470277331"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:44Z","timestamp":1620114884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}