{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:17:22Z","timestamp":1743038242942,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_1","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision"],"prefix":"10.1007","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianbo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling on Parallel Machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/978-3-540-85363-3_2","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Asadpour","year":"2008","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus Meets Hypergraph Matchings. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 10\u201320. Springer, Heidelberg (2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods. In: Proc. of ACM-SIAM Symposium on the Theory of Computation (STOC), pp. 114\u2013121 (2007)","DOI":"10.1145\/1250790.1250808"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus Problem. In: Proc. of ACM-SIAM Symposium on the Theory of Computation (STOC), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I. Bezakova","year":"2005","unstructured":"Bezakova, I., Dani, V.: Allocating Indivisible Goods. SIGecom Exchanges\u00a05(3), 11\u201318 (2005)","journal-title":"SIGecom Exchanges"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On Allocating Goods to Maximize Fairness (manuscript, 2009)","DOI":"10.1109\/FOCS.2009.51"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L. Epstein","year":"2004","unstructured":"Epstein, L., Sgall, J.: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica\u00a039(1), 43\u201357 (2004)","journal-title":"Algorithmica"},{"key":"1_CR8","unstructured":"Feige, U.: On Allocations that Maximize Fairness. In: ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pp. 287\u2013293 (2008)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H.C. Hwang","year":"2004","unstructured":"Hwang, H.C., Chang, S.Y., Lee, K.: Parallel Machine Scheduling under a Grade of Service Provision. Computers and Operations Research\u00a031, 2055\u20132061 (2004)","journal-title":"Computers and Operations Research"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation Algorithms for Scheduling Unrelated Parallel Machines. Mathematical Programming, Series A\u00a046(2), 259\u2013271 (1990)","journal-title":"Mathematical Programming, Series A"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1002\/nav.20286","volume":"55","author":"J. Ou","year":"2008","unstructured":"Ou, J., Leung, J.Y.-T., Li, C.L.: Scheduling Parallel Machines with Inclusive Processing Set Restrictions. Naval Research Logistics\u00a055(4), 328\u2013338 (2008)","journal-title":"Naval Research Logistics"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial Time Approximation Algorithms for Machine Scheduling: Ten Open Problems. Journal of Scheduling\u00a02, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G.J. Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS Journal on Computing\u00a012, 57\u201375 (2000)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:53:50Z","timestamp":1714622030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}