{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:22:46Z","timestamp":1778595766745,"version":"3.51.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046927","type":"print"},{"value":"9783030046934","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_4","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T05:03:12Z","timestamp":1543381392000},"page":"51-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Primal-Dual Online Deterministic Algorithm for Matching with Delays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0194-9360","authenticated-orcid":false,"given":"Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"key":"4_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-18263-6_2","volume-title":"WAOA 2014","author":"A Antoniadis","year":"2014","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A o(n)-competitive deterministic algorithm for online matching on a line. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 11\u201322. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_2"},{"key":"4_CR2","unstructured":"Ashlagi, I., et al.: Min-cost bipartite perfect matching with delays. In: Proceedings of 20th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 1:1\u20131:20 (2017)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Avontuur, T., Spronck, P., van Zaanen, M.: Player skill modeling in Starcraft II. In: Proceedings of 9th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2013 (2013)","DOI":"10.1609\/aiide.v9i1.12682"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1051\u20131061 (2017)","DOI":"10.1137\/1.9781611974782.67"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings of 49th ACM Symposium on Theory of Computing (STOC), pp. 551\u2013563 (2017)","DOI":"10.1145\/3055399.3055475"},{"key":"4_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-89441-6_11","volume-title":"WAOA 2018","author":"Y Azar","year":"2018","unstructured":"Azar, Y., Jacob-Fanani, A.: Deterministic min-cost matching with delays. In: Solis-Oba, R., Fleischer, R. (eds.) WAOA 2018. LNCS, vol. 10787, pp. 132\u2013146. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_11"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s00453-012-9676-9","volume":"68","author":"N Bansal","year":"2014","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.: A randomized $$O(\\log ^2 k)$$-competitive algorithm for metric bipartite matching. Algorithmica 68(2), 390\u2013403 (2014)","journal-title":"Algorithmica"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2783434","volume":"62","author":"Nikhil Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM 62(5), 40:1\u201340:49 (2015)","journal-title":"Journal of the ACM"},{"key":"4_CR9","unstructured":"Bienkowski, M., et al.: Online algorithms for multi-level aggregation. In: Proceedings of 24th European Symposium on Algorithms, ESA 2016, pp. 12:1\u201312:17 (2016)"},{"key":"4_CR10","first-page":"42","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Marcin Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, L., Nogneng, D., Sgall, J.: Better approximation bounds for the joint replenishment problem. In: Proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 42\u201354 (2014)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40104-6_12","volume-title":"Algorithms and Data Structures","author":"M Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., Sgall, J., Stachowiak, G.: Online control message aggregation in chain networks. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 133\u2013145. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_12"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-89441-6_11","volume-title":"Approximation and Online Algorithms","author":"M Bienkowski","year":"2018","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: A match in time saves nine: deterministic online matching with delays. In: Solis-Oba, R., Fleischer, R. (eds.) WAOA 2017. LNCS, vol. 10787, pp. 132\u2013146. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89441-6_11"},{"key":"4_CR13","series-title":"LNCS","first-page":"237","volume-title":"SIROCCO 2018","author":"M Bienkowski","year":"2018","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: Online service with delay on a line. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 237\u2013248. Springer, Heidelberg (2018)"},{"key":"4_CR14","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Talmon, O.: O(depth)-competitive algorithm for online multi-level aggregation. In: Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1235\u20131244 (2017)","DOI":"10.1137\/1.9781611974782.80"},{"key":"4_CR16","unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online make-to-order joint replenishment model: primal dual competitive algorithms. In: Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 952\u2013961 (2008)"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1189056.1189078","volume":"37","author":"M Chrobak","year":"2006","unstructured":"Chrobak, M., Kenyon-Mathieu, C.: Competitiveness via doubling. SIGACT News 37(4), 115\u2013126 (2006)","journal-title":"SIGACT News"},{"issue":"2","key":"4_CR18","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":"4_CR19","unstructured":"Elo, A.E.: The Rating of Chessplayers, Past and Present. Arco Publishing, London (1978)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste! In: Proceedings of 48th ACM Symposium on Theory of Computing (STOC), pp. 333\u2013344 (2016)","DOI":"10.1145\/2897518.2897557"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-57586-5_18","volume-title":"Algorithms and Complexity","author":"Y Emek","year":"2017","unstructured":"Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for two sources. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 209\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_18"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"4_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.10.028","volume":"332","author":"B Fuchs","year":"2005","unstructured":"Fuchs, B., Hochst\u00e4ttler, W., Kern, W.: Online matching on a line. Theoret. Comput. Sci. 332(1\u20133), 251\u2013264 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-31594-7_36","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 424\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_36"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"AR Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e - 1). Algorithmica 36(3), 209\u2013224 (2003)","journal-title":"Algorithmica"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45465-9_13","volume-title":"Automata, Languages and Programming","author":"S Khanna","year":"2002","unstructured":"Khanna, S., Naor, J.S., Raz, D.: Control message aggregation in group communication protocols. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 135\u2013146. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_13"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theoret. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-24592-6_14","volume-title":"Approximation and Online Algorithms","author":"E Koutsoupias","year":"2004","unstructured":"Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 179\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_14"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Lowalekar, M., Varakantham, P., Jaillet, P.: Online spatio-temporal matching in stochastic and dynamic domains. In: Proceedings of 30th AAAI Conference on Artificial Intelligence, pp. 3271\u20133277 (2016)","DOI":"10.1609\/aaai.v30i1.10425"},{"issue":"4","key":"4_CR33","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theoret. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., Poplawski, L.J.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 954\u2013959 (2006)","DOI":"10.1145\/1109557.1109662"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: Proceedings of 58th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 505\u2013515 (2017)","DOI":"10.1109\/FOCS.2017.53"},{"key":"4_CR36","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Proceedings of 19th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 18:1\u201318:16 (2016)"},{"key":"4_CR37","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:23:18Z","timestamp":1710249798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}