{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:14Z","timestamp":1759638674625,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["JA 612\/15-1"],"award-info":[{"award-number":["JA 612\/15-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00453-017-0314-4","type":"journal-article","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T09:57:42Z","timestamp":1493287062000},"page":"1357-1382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Estimating the Makespan of the Two-Valued Restricted Assignment Problem"],"prefix":"10.1007","volume":"80","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9295-8229","authenticated-orcid":false,"given":"Kati","family":"Land","sequence":"additional","affiliation":[]},{"given":"Marten","family":"Maack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"314_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, (STOC 2006), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"314_CR2","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Khanna, S., Li, S.: On \n                        $$(1, \\epsilon )$$\n                        \n                            \n                                \n                                    (\n                                    1\n                                    ,\n                                    \u03f5\n                                    )\n                                \n                            \n                        \n                    -restricted assignment makespan minimization. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1087\u20131101 (2015)","DOI":"10.1137\/1.9781611973730.73"},{"issue":"1","key":"314_CR3","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/s00453-012-9668-9","volume":"68","author":"T Ebenlendr","year":"2014","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. Algorithmica 68(1), 62\u201380 (2014)","journal-title":"Algorithmica"},{"key":"314_CR4","unstructured":"Huang, C.-C., Ott, S.: A combinatorial approximation algorithm for graph balancing with light hyper edges. CoRR. \n                        arxiv:abs\/1507.07396\n                        \n                     (2015)"},{"issue":"1","key":"314_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ipl.2012.09.004","volume":"113","author":"SG Kolliopoulos","year":"2013","unstructured":"Kolliopoulos, S.G., Moysoglou, Y.: The 2-valued case of makespan minimization with assignment constraints. Inf. Process. Lett. 113(1), 39\u201343 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"314_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1\u20133), 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"314_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"EV Shchepin","year":"2005","unstructured":"Shchepin, E.V., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Oper. Res. Lett. 33(2), 127\u2013133 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"314_CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(1\u20133), 461\u2013474 (1993)","journal-title":"Math. Program."},{"issue":"5","key":"314_CR9","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"key":"314_CR10","doi-asserted-by":"crossref","unstructured":"Verschae, J., Wiese, A.: On the configuration-LP for scheduling on unrelated machines. In: Algorithms\u2014ESA 2011. Springer, pp. 530\u2013542 (2011)","DOI":"10.1007\/978-3-642-23719-5_45"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0314-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0314-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0314-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T14:55:33Z","timestamp":1519743333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0314-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["314"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0314-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,4,27]]}}}