{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:30Z","timestamp":1757617470246,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_15","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:46Z","timestamp":1741105966000},"page":"178-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MPMD on\u00a0Two Sources with\u00a0Lookahead"],"prefix":"10.1007","author":[{"given":"Enze","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengshi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/PL00009158","volume":"18","author":"S Albers","year":"1997","unstructured":"Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica 18(3), 283\u2013305 (1997)","journal-title":"Algorithmica"},{"key":"15_CR2","unstructured":"Ashlagi, I., et al.: Min-cost bipartite perfect matching with delays. In: Jansen, K., Rolim, J.D.P., Williamson, D., Vempala, S.S. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. LIPIcs, vol.\u00a081, pp. 1:1\u20131:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 1051\u20131061. SIAM (2017)","DOI":"10.1137\/1.9781611974782.67"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/s00224-019-09963-7","volume":"64","author":"Y Azar","year":"2020","unstructured":"Azar, Y., Fanani, A.J.: Deterministic min-cost matching with delays. Theory Comput. Syst. 64(4), 572\u2013592 (2020)","journal-title":"Theory Comput. Syst."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2019.01.013","volume":"776","author":"M B\u00f6hm","year":"2019","unstructured":"B\u00f6hm, M., Chrobak, M., Jez, L., Li, F., Sgall, J., Vesel\u00fd, P.: Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776, 95\u2013113 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: TCP dynamic acknowledgment delay: Theory and practice (extended abstract). In: Vitter, J.S. (ed.) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 389\u2013398. ACM (1998)","DOI":"10.1145\/276698.276792"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"DR Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. J. ACM 48(2), 243\u2013273 (2001)","journal-title":"J. ACM"},{"key":"15_CR8","unstructured":"Dunke, F.: Online optimization with lookahead. Ph.D. thesis, Karlsruhe, Karlsruher Institut f\u00fcr Technologie (KIT), Diss., 2014 (2014)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.omega.2015.10.009","volume":"63","author":"F Dunke","year":"2016","unstructured":"Dunke, F., Nickel, S.: A general modeling approach to online optimization with lookahead. Omega 63, 134\u2013153 (2016)","journal-title":"Omega"},{"key":"15_CR10","unstructured":"Efroni, Y., Ghavamzadeh, M., Mannor, S.: Online planning with lookahead policies. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual (2020)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste! In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 333\u2013344. ACM (2016)","DOI":"10.1145\/2897518.2897557"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2018.07.004","volume":"754","author":"Y Emek","year":"2019","unstructured":"Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for two sources. Theor. Comput. Sci. 754, 122\u2013129 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-031-48974-7_20","volume-title":"Web and Internet Economics: 19th International Conference, WINE 2023, Shanghai, China, December 4\u20138, 2023, Proceedings","author":"K He","year":"2024","unstructured":"He, K., Li, S., Sun, E., Wang, Y., Wattenhofer, R., Zhu, W.: Randomized algorithm for mpmd on two sources. In: Garg, J., Klimm, M., Kong, Y. (eds.) Web and Internet Economics: 19th International Conference, WINE 2023, Shanghai, China, December 4\u20138, 2023, Proceedings, pp. 348\u2013365. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-48974-7_20"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Jiao, C., Yuan, J., Feng, Q.: Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead. Asia Pac. J. Oper. Res. 36(5), 1950024:1\u20131950024:8 (2019)","DOI":"10.1142\/S0217595919500246"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e-1). In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 502\u2013509. ACM (2001)","DOI":"10.1145\/380752.380845"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"AR Karlin","year":"1994","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.S.: Competitive randomized algorithms for nonuniform problems. Algorithmica 11(6), 542\u2013571 (1994)","journal-title":"Algorithmica"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01762111","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3, 77\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/ijoc.10.3.331","volume":"10","author":"R Motwani","year":"1998","unstructured":"Motwani, R., Saraswat, V.A., Torng, E.: Online scheduling with lookahead: Multipass assembly lines. INFORMS J. Comput. 10(3), 331\u2013340 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.cor.2012.06.003","volume":"40","author":"F Zheng","year":"2013","unstructured":"Zheng, F., Cheng, Y., Liu, M., Xu, Y.: Online interval scheduling on a single machine with finite lookahead. Comput. Oper. Res. 40(1), 180\u2013191 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:08:01Z","timestamp":1757142481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}