{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:13:15Z","timestamp":1725570795088},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_15","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T08:54:45Z","timestamp":1291625685000},"page":"182-193","source":"Crossref","is-referenced-by-count":0,"title":["A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Annam\u00e1ria","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd Annual Symposium on Foundations of Computer Science, pp. 482\u2013491 (2001)","key":"15_CR1","DOI":"10.1109\/SFCS.2001.959924"},{"doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: Proc. 39th Annual ACM Symp. Theory of Comp. (STOC), pp. 114\u2013121. ACM, New York (2007)","key":"15_CR2","DOI":"10.1145\/1250790.1250808"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-63397-9_3","volume-title":"Algorithms - ESA \u201997","author":"Y. Azar","year":"1997","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 23\u201336. Springer, Heidelberg (1997)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0053962","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: Approximation schemes for covering and scheduling on related machines. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 39\u201347. Springer, Heidelberg (1998)"},{"key":"15_CR5","first-page":"543","volume-title":"Proc. 41st Annual ACM Symp. Theory of Comp.","author":"M. Bateni","year":"2009","unstructured":"Bateni, M., Charikar, M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proc. 41st Annual ACM Symp. Theory of Comp., pp. 543\u2013552. ACM, New York (2009)"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proc. 50th Annual IEEE Symp. on Found. of Comp. Sci. (FOCS), pp. 107\u2013116. IEEE Computer Society, Los Alamitos (2009)","key":"15_CR6","DOI":"10.1109\/FOCS.2009.51"},{"doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Kov\u00e1cs, A.: A deterministic truthful PTAS for scheduling related machines. In: Proc. 21st SIAM Symp. on Disc. Algs. (SODA), pp. 1005\u20131016. SIAM, Philadelphia (2010)","key":"15_CR7","DOI":"10.1137\/1.9781611973075.81"},{"doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. In: Proc. 49th IEEE Symp. on Found. of Comp. Sci., FOCS (2008)","key":"15_CR8","DOI":"10.1109\/FOCS.2008.71"},{"issue":"1-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.tcs.2006.05.025","volume":"359","author":"P.S. Efraimidis","year":"2006","unstructured":"Efraimidis, P.S., Spirakis, P.G.: Approximation schemes for scheduling and covering on unrelated machines. Theoretical Computer Science\u00a0359(1-3), 400\u2013417 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"15_CR10","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"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2009.08.032","volume":"411","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., van Stee, R.: Maximizing the minimum load for selfish agents. Theoretical Computer Science\u00a0411(1), 44\u201357 (2010)","journal-title":"Theoretical Computer Science"},{"unstructured":"Feige, U.: On allocations that maximize fairness. In: Proc. 19th annual ACM-SIAM Symp. Discr. Algs. (SODA), pp. 287\u2013293. SIAM, Philadelphia (2008)","key":"15_CR12"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1143\u20131152 (2007)","key":"15_CR14"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-15775-2_4","volume-title":"Algorithms \u2013 ESA 2010","author":"M. Skutella","year":"2010","unstructured":"Skutella, M., Verschae, J.: A robust PTAS for machine covering and packing. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 36\u201347. Springer, Heidelberg (2010)"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G.J. Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters\u00a020(4), 149\u2013154 (1997)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T18:25:21Z","timestamp":1553279121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}