{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:40:13Z","timestamp":1743086413565,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_13","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"158-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)"],"prefix":"10.1007","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"}]},{"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":[[2020,4,14]]},"reference":[{"key":"13_CR1","unstructured":"Adamaszek, A., Chalermsook, P., Wiese, A.: How to tame rectangles: solving independent set and coloring of rectangles via shrinking. In: APPROX\/RANDOM, pp. 43\u201360 (2015)"},{"issue":"2","key":"13_CR2","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."},{"issue":"1","key":"13_CR3","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":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-22935-0_11","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P Chalermsook","year":"2011","unstructured":"Chalermsook, P.: Coloring and maximum independent set of rectangles. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2011. LNCS, vol. 6845, pp. 123\u2013134. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_11"},{"key":"13_CR5","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"},{"issue":"1","key":"13_CR6","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":"13_CR7","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. Discret. Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"13_CR8","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"},{"issue":"3","key":"13_CR9","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."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Nagarajan, V., Shen, X.: Stochastic load balancing on unrelated machines. In: SODA, pp. 1274\u20131285. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.83"},{"key":"13_CR11","unstructured":"Gupta, A., Kumar, A., Nagarajan, V., Shen, X.: Stochastic makespan minimization in structured set systems. arXiv (2020). https:\/\/arxiv.org\/abs\/2002.11153"},{"issue":"3","key":"13_CR12","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":"13_CR13","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":"13_CR14","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":"13_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T22:44:28Z","timestamp":1722725068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}