{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:46Z","timestamp":1725879706502},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_24","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"267-280","source":"Crossref","is-referenced-by-count":1,"title":["Demand Hitting and Covering of Intervals"],"prefix":"10.1007","author":[{"given":"Datta","family":"Krupa R.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniket","family":"Basu Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minati","family":"De","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathish","family":"Govindarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-33090-2_14","volume-title":"Algorithms \u2013 ESA 2012","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 145\u2013156. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33090-2_14"},{"issue":"5","key":"24_CR2","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1137\/130911317","volume":"43","author":"N Bansal","year":"2014","unstructured":"Bansal, N., Pruhs, K.: The geometry of scheduling. SIAM J. Comput. 43(5), 1684\u20131698 (2014)","journal-title":"SIAM J. Comput."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Appl. Math. 59(3), 225\u2013235 (1995). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X9580003M","DOI":"10.1016\/0166-218X(95)80003-M"},{"key":"24_CR4","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. 6080, pp. 355\u2013368. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13036-6_27"},{"issue":"1","key":"24_CR5","first-page":"9","volume":"9","author":"C Chekuri","year":"2012","unstructured":"Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multicover problem in geometric settings. ACM Trans. Algorithms (TALG) 9(1), 9 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"24_CR6","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S.M., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3), 34:1\u201334:17 (2008). http:\/\/doi.acm.org\/10.1145\/1367064.1367074"},{"key":"24_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"key":"24_CR8","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Pearson Education India, Delhi (2006)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: 8. network flows. In: Data Structures and Network Algorithms, Chap. 8, pp. 97\u2013112. SIAM (1983). http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611970265.ch8","DOI":"10.1137\/1.9781611970265.ch8"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:23Z","timestamp":1498368923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}