{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:51Z","timestamp":1725878091253},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319517407"},{"type":"electronic","value":"9783319517414"}],"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-51741-4_14","type":"book-chapter","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T08:06:46Z","timestamp":1483690006000},"page":"170-182","source":"Crossref","is-referenced-by-count":1,"title":["Tight Approximation Bounds for the Seminar Assignment Problem"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"George","family":"Rabanca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M., Thielen, C., Westphal, S.: A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items. In: Mathematical Foundations of Computer Science, pp. 135\u2013145 (2013)","DOI":"10.1007\/978-3-642-40313-2_14"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M., Thielen, C., Westphal, S.: Erratum: A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items. In: Mathematical Foundations of Computer Science, pp. E1\u2013E3 (2013)","DOI":"10.1007\/978-3-642-40313-2_74"},{"issue":"3","key":"14_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"D Cattrysse","year":"1992","unstructured":"Cattrysse, D., Van Wassenhove, L.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3), 260\u2013272 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"14_CR4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162\u2013166 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"14_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M., Mirrokni, V., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006 (2006)","DOI":"10.1145\/1109557.1109624"},{"issue":"1","key":"14_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"14_CR8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2013.01.027","volume":"228","author":"S Krumke","year":"2013","unstructured":"Krumke, S., Thielen, C.: The generalized assignment problem with minimum quantities. Eur. J. Oper. Res. 228(1), 46\u201355 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kundakcioglu, O., Alizamir, S.: Generalized assignment problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 1153\u20131162. Springer, US (2009)","DOI":"10.1007\/978-0-387-74759-0_200"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Maximizing submodular set functions: formulations and analysis of algorithms. In: Hansen, P. (ed.) Studies on Graphs and Discrete Programming, pp. 279\u2013301. North-Holland, Amsterdam (1981)","DOI":"10.1016\/S0304-0208(08)73471-6"},{"issue":"3","key":"14_CR11","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D Shmoys","year":"1993","unstructured":"Shmoys, D., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3), 461\u2013474 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(93)90006-A","volume":"43","author":"R Vohra","year":"1993","unstructured":"Vohra, R., Hall, N.: A probabilistic analysis of the maximal covering location problem. Discrete Appl. Math. 43(2), 175\u2013183 (1993)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51741-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T06:37:56Z","timestamp":1568702276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51741-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319517407","9783319517414"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51741-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}