{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:58Z","timestamp":1725490198775},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_15","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"204-217","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for the Max-Min Allocation Problem"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Khot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashok Kumar","family":"Ponnuswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: STOC 2007 (to appear)","key":"15_CR1","DOI":"10.1145\/1250790.1250808"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y","volume":"1","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. J. Sched.\u00a01(2), 67\u201377 (1998)","journal-title":"J. Sched."},{"key":"15_CR3","first-page":"31","volume-title":"STOC 2006","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: STOC 2006. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 31\u201340. ACM Press, New York (2006)"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I. Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. SIGecom Exchanges\u00a05(3), 11\u201318 (2005)","journal-title":"SIGecom Exchanges"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dam.2005.02.002","volume":"148","author":"L. Epstein","year":"2005","unstructured":"Epstein, L.: Tight bounds for bandwidth allocation on two links. Discrete Appl. Math.\u00a0148(2), 181\u2013188 (2005)","journal-title":"Discrete Appl. Math."},{"unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Technical Report CMU-CS-05-144, Carnegie Mellon University (2005)","key":"15_CR6"},{"key":"15_CR7","first-page":"18","volume-title":"EC 2001","author":"B. Lehmann","year":"2001","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: EC 2001. Proceedings of the Third ACM Conference on Electronic Commerce, pp. 18\u201328. ACM Press, New York (2001)"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF01933625","volume":"23","author":"K.M. Mjelde","year":"1983","unstructured":"Mjelde, K.M.: Max-min resource allocation. BIT Numerical Mathematics\u00a023(4), 529\u2013537 (1983)","journal-title":"BIT Numerical Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Ramirez-Marquez, J.E., Coit, D.W., Konak, A.: Redundancy allocation for series-parallel systems using a max-min approach. IIE Transactions, 891\u2013898 (2004)","key":"15_CR9","DOI":"10.1080\/07408170490473097"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2004.10.002","volume":"196","author":"Z. Tan","year":"2005","unstructured":"Tan, Z., He, Y., Epstein, L.: Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Inf. Comput.\u00a0196(1), 57\u201370 (2005)","journal-title":"Inf. Comput."},{"key":"15_CR11","first-page":"329","volume-title":"ISCC 2003","author":"M. Younis","year":"2003","unstructured":"Younis, M., Akkaya, K., Kunjithapatham, A.: Optimization of task allocation in a cluster-based sensor network. In: ISCC 2003. Proceedings of the Eighth IEEE International Symposium on Computers and Communications, Washington, DC, USA, 2003, p. 329. IEEE Computer Society Press, Los Alamitos (2003)"}],"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-540-74208-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:16:32Z","timestamp":1550873792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}