{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:46Z","timestamp":1740109306453,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-190782","CCF-1750127"],"award-info":[{"award-number":["CCF-190782","CCF-1750127"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1940766"],"award-info":[{"award-number":["CMMI-1940766"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"division of computing and communication foundations","doi-asserted-by":"publisher","award":["2006778","2006953"],"award-info":[{"award-number":["2006778","2006953"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10107-021-01741-z","type":"journal-article","created":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T12:02:43Z","timestamp":1637928163000},"page":"597-630","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic makespan minimization in structured set systems"],"prefix":"10.1007","volume":"192","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9514-5581","authenticated-orcid":false,"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangkun","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,26]]},"reference":[{"issue":"2","key":"1741_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"PK Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2d. Comput. Geom. 34(2), 83\u201395 (2006)","journal-title":"Comput. Geom."},{"key":"1741_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Pach, J., Sharir, M.: State of the union of geometric objects. In: Surveys in Discrete and Computational Geometry Twenty Years Later, pp. 9\u201348 (2008)","DOI":"10.1090\/conm\/453\/08794"},{"issue":"2","key":"1741_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/120891241","volume":"43","author":"B Aronov","year":"2014","unstructured":"Aronov, B., de Berg, M., Ezra, E., Sharir, M.: Improved bounds for the union of locally fat objects in the plane. SIAM J. Comput. 43(2), 543\u2013572 (2014)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1741_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.10033","volume":"20","author":"RD Carr","year":"2002","unstructured":"Carr, R.D., Vempala, S.S.: Randomized metarounding. Random Struct. Algorithms 20(3), 343\u2013352 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"1741_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"key":"1741_CR6","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: SODA, pp. 892\u2013901 (2009)","DOI":"10.1137\/1.9781611973068.97"},{"key":"1741_CR7","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Walczak, B.: Coloring and maximum weight independent set of rectangles. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 860\u2013868 (2021)","DOI":"10.1137\/1.9781611976465.54"},{"issue":"1","key":"1741_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ipl.2003.09.019","volume":"89","author":"TM Chan","year":"2004","unstructured":"Chan, T.M.: A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. 89(1), 19\u201323 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1741_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"1741_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1273340.1273343","volume":"3","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms 3(3), 27 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"1741_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23\u201326, 2010, Las Vegas, Nevada, USA, pp. 575\u2013584 (2010)","DOI":"10.1109\/FOCS.2010.60"},{"issue":"8","key":"1741_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789\u2013810 (1977)","journal-title":"Manag. Sci."},{"issue":"3","key":"1741_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/90.234855","volume":"1","author":"AI Elwalid","year":"1993","unstructured":"Elwalid, A.I., Mitra, D.: Effective bandwidth of general markovian traffic sources and admission control of high speed networks. IEEE\/ACM Trans. Netw. 1(3), 329\u2013343 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"1741_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/moor.2019.1049","volume":"46","author":"A Gupta","year":"2021","unstructured":"Gupta, A., Kumar, A., Nagarajan, V., Shen, X.: Stochastic load balancing on unrelated machines. Math. Oper. Res. 46(1), 115\u2013133 (2021)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1741_CR15","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1109\/49.12887","volume":"6","author":"JY Hui","year":"1988","unstructured":"Hui, J.Y.: Resource allocation for broadband networks. IEEE J. Sel. Areas Commun. 6(3), 1598\u20131608 (1988)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1741_CR16","doi-asserted-by":"crossref","unstructured":"Kelly, F.P.: Notes on effective bandwidths. In: Stochastic Networks: Theory and Applications, pp. 141\u2013168. Oxford University Press (1996)","DOI":"10.1093\/oso\/9780198523994.003.0008"},{"issue":"1","key":"1741_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. SIAM J. Comput. 30(1), 191\u2013217 (2000)","journal-title":"SIAM J. Comput."},{"key":"1741_CR18","doi-asserted-by":"crossref","unstructured":"Molinaro, M.: Stochastic $$\\ell _p$$ load balancing and moment problems via the l-function method. In: SODA, pp. 343\u2013354 (2019)","DOI":"10.1137\/1.9781611975482.22"},{"issue":"2","key":"1741_CR19","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29(2), 648\u2013670 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01741-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01741-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01741-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T05:04:29Z","timestamp":1699851869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01741-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1741"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01741-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"14 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}