{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:19Z","timestamp":1759638439356},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"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-59250-3_25","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"305-316","source":"Crossref","is-referenced-by-count":3,"title":["A Quasi-Polynomial Approximation for the Restricted Assignment Problem"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"25_CR1","unstructured":"Annamalai, C.: Lazy local search meets machine scheduling. CoRR abs\/1611.07371 (2016). \nhttp:\/\/arxiv.org\/abs\/1611.07371"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Annamalai, C., Kalaitzis, C., Svensson, O.: Combinatorial algorithm for restricted max-min fair allocation. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1357\u20131372 (2015). doi:\n10.1137\/1.9781611973730.90","DOI":"10.1137\/1.9781611973730.90"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 21\u201323 May 2006, pp. 31\u201340 (2006). doi:\n10.1145\/1132516.1132522","DOI":"10.1145\/1132516.1132522"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Chakrabarty, D., Khanna, S., Li, S.: On \n            $$(1, \\epsilon )$$\n          -restricted assignment makespan minimization. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1087\u20131101 (2015). doi:\n10.1137\/1.9781611973730.73","DOI":"10.1137\/1.9781611973730.73"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1137\/140952636","volume":"30","author":"K Jansen","year":"2016","unstructured":"Jansen, K., Land, F., Land, K.: Bounding the running time of algorithms for scheduling and packing problems. SIAM J. Discrete Math. 30(1), 343\u2013366 (2016). doi:\n10.1137\/140952636","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Jansen, K., Land, K., Maack, M.: Estimating the makespan of the two-valued restricted assignment problem. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, Reykjavik, Iceland, 22\u201324 June 2016, pp. 24:1\u201324:13 (2016). doi:\n10.4230\/LIPIcs.SWAT.2016.24","DOI":"10.4230\/LIPIcs.SWAT.2016.24"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Jansen, K., Rohwedder, L.: On the Configuration-LP of the restricted assignment problem. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January, pp. 2670\u20132678 (2017). doi:\n10.1137\/1.9781611974782.176","DOI":"10.1137\/1.9781611974782.176"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(3), 259\u2013271 (1990). doi:\n10.1007\/BF01585745","journal-title":"Math. Program."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2818695","volume":"12","author":"L Pol\u00e1cek","year":"2016","unstructured":"Pol\u00e1cek, L., Svensson, O.: Quasi-polynomial local search for restricted max-min fair allocation. ACM Trans. Algorithms 12(2), 13 (2016). doi:\n10.1145\/2818695","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/110851201","volume":"41","author":"O Svensson","year":"2012","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. SIAM J. Comput. 41(5), 1318\u20131341 (2012). doi:\n10.1137\/110851201","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:10:56Z","timestamp":1495545056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}