{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:45Z","timestamp":1725603645515},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_46","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"543-554","source":"Crossref","is-referenced-by-count":6,"title":["Resource Allocation for Covering Time Varying Demands"],"prefix":"10.1007","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Sambuddha","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: STOC (2006)","DOI":"10.1145\/1132516.1132617"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Schulz, J., Wiese, A.: A constant factor approximation algorithm for unsplittable flow on paths. In: FOCS (2011)","DOI":"10.1109\/FOCS.2011.10"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-68891-4_20","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Carnes","year":"2008","unstructured":"Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 288\u2013302. Springer, Heidelberg (2008)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V., Kumar, A., Parija, G., Roy, S., Sabharwal, Y.: Minimum cost resource allocation for meeting job requirements. In: IPDPS (2011)","DOI":"10.1109\/IPDPS.2011.12"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Grant, E., K\u00f6nemann, J.: On column-restricted and priority covering integer programs. In: IPCO (2010)","DOI":"10.1007\/978-3-642-13036-6_27"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms 3(3) (2007)","DOI":"10.1145\/1273340.1273343"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Dhesi, A., Gupta, P., Kumar, A., Parija, G., Roy, S.: Contact center scheduling with strict resource requirements. In: IPCO (2011)","DOI":"10.1007\/978-3-642-20807-2_13"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms\u00a053(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"46_CR9","unstructured":"Garg, N.: Saving an \u03b5: a 2-approximation for the k-MST problem in graphs. In: STOC, pp. 396\u2013402 (2005)"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Golovin, D., Nagarajan, V., Singh, M.: Approximating the k-multicut problem. In: SODA (2006)","DOI":"10.1145\/1109557.1109625"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM\u00a022, 463\u2013468 (1975)","journal-title":"J. ACM"},{"issue":"1","key":"46_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ejor.2009.04.026","volume":"202","author":"A. Ingolfsson","year":"2010","unstructured":"Ingolfsson, A., Campello, F., Wu, X., Cabral, E.: Combining Integer Programming and the Randomization Method to Schedule Employees. European J. Operations Research\u00a0202(1), 153\u2013163 (2010)","journal-title":"European J. Operations Research"},{"issue":"2","key":"46_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:07:53Z","timestamp":1560528473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}