{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:10Z","timestamp":1725600310769},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_4","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:20:39Z","timestamp":1313140839000},"page":"38-49","source":"Crossref","is-referenced-by-count":7,"title":["On Capacitated Set Cover Problems"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Ravishankar","family":"Krishnaswamy","sequence":"additional","affiliation":[]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: The geometry of scheduling. In: FOCS 2010, pp. 407\u2013414 (2010)","DOI":"10.1109\/FOCS.2010.46"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.(S.), Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM\u00a048, 1069\u20131090 (2001)","journal-title":"J. ACM"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Bronnimann","year":"1995","unstructured":"Bronnimann, H., Goodrich, M.: Almost optimal set covers in finite VC-dimension. Discrete and Computational Geometry\u00a014, 463\u2013479 (1995)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR4","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA 2000, pp. 106\u2013115 (2000)"},{"key":"4_CR5","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)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TNET.2004.826288","volume":"12","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Naor, J.(S.), Schieber, B.: Resource optimization in qos multicast routing of real-time multimedia. IEEE\/ACM Trans. Netw.\u00a012, 340\u2013348 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"4_CR7","unstructured":"Chuzhoy, J., Gupta, A., Naor, J.(S.), Sinha, A.: On the approximability of some network design problems. In: SODA 2005, pp. 943\u2013951 (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., P\u00e1lv\u00f6lgyi, D., Rothvo\u00df, T.: Bin packing via discrepancy of permutations. In: SODA, pp. 476\u2013481 (2011)","DOI":"10.1137\/1.9781611973082.38"},{"key":"4_CR9","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, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0166-218X(02)00598-X","volume":"129","author":"S.G. Kolliopoulos","year":"2003","unstructured":"Kolliopoulos, S.G.: Approximating covering integer programs with multiplicity constraints. Discrete Appl. Math.\u00a0129, 461\u2013473 (2003)","journal-title":"Discrete Appl. Math."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Pach, J., Tardos, G.: Tight lower bounds for the size of epsilon-nets. CoRR, abs\/1012.1240 (2010)","DOI":"10.1145\/1998196.1998271"},{"key":"4_CR12","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.: Weighted geometric set cover via quasi-uniform sampling. In: STOC 2010, pp. 641\u2013648 (2010)","DOI":"10.1145\/1806689.1806777"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T01:03:10Z","timestamp":1560474190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}