{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:02:48Z","timestamp":1743055368049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-89441-6_19","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"253-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Conceptually Simple Algorithms for\u00a0Variants of Online Bipartite Matching"],"prefix":"10.1007","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[]},{"given":"Denis","family":"Pankratov","sequence":"additional","affiliation":[]},{"given":"Amirali","family":"Salehi-Abari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-45753-4_5","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S Angelopoulos","year":"2002","unstructured":"Angelopoulos, S., Borodin, A.: On the power of priority algorithms for facility location and set cover. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 26\u201339. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45753-4_5"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/rsa.3240060107","volume":"6","author":"J Aronson","year":"1995","unstructured":"Aronson, J., Dyer, M., Frieze, A., Suen, S.: Randomized greedy matching. II. Random Struct. Algorithms 6(1), 55\u201373 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-15775-2_15","volume-title":"Algorithms \u2013 ESA 2010","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Kapralov, M.: Improved bounds for online stochastic matching. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 170\u2013181. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_15"},{"key":"19_CR4","first-page":"1","volume":"80","author":"B Besser","year":"2017","unstructured":"Besser, B., Poloczek, M.: Erratum to: greedy matching: guarantees and limitations. Algorithmica 80, 1\u20134 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-015-0062-2","volume":"77","author":"B Besser","year":"2017","unstructured":"Besser, B., Poloczek, M.: Greedy matching: guarantees and limitations. Algorithmica 77(1), 201\u2013234 (2017)","journal-title":"Algorithmica"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-31833-0_12","volume-title":"Approximation and Online Algorithms","author":"A Borodin","year":"2005","unstructured":"Borodin, A., Boyar, J., Larsen, K.S.: Priority algorithms for graph optimization problems. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 126\u2013139. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31833-0_12"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.010","volume":"418","author":"A Borodin","year":"2012","unstructured":"Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theor. Comput. Sci. 418, 1\u201313 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37(4), 295\u2013326 (2003)","journal-title":"Algorithmica"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Borodin, A., Pankratov, D., Salehi-Abari, A.: On conceptually simple algorithms for variants of online bipartite matching. CoRR, abs\/1706.09966 (2017)","DOI":"10.1007\/978-3-319-89441-6_19"},{"key":"19_CR10","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: New algorithms, better bounds, and a novel model for online stochastic matching. In: Proceedings of ESA, pp. 24:1\u201324:16 (2016)"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2), 223\u2013240 (2001)","journal-title":"J. Algorithms"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00453-007-9124-4","volume":"54","author":"S Davis","year":"2009","unstructured":"Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. Algorithmica 54(3), 269\u2013317 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1:1\u20131:23 (2014)","journal-title":"J. ACM"},{"key":"19_CR15","unstructured":"D\u00fcrr, C., Konrad, C., Renault, M.: On the power of advice and randomization for online bipartite matching. In: Proceedings of ESA, pp. 37:1\u201337:16 (2016)"},{"issue":"1\u20132","key":"19_CR16","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-011-9556-8","volume":"63","author":"S Eggert","year":"2012","unstructured":"Eggert, S., Kliemann, L., Munstermann, P., Srivastav, A.: Bipartite matching in the semi-streaming model. Algorithmica 63(1\u20132), 490\u2013508 (2012)","journal-title":"Algorithmica"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating 1-1\/e. In: Proceedings of FOCS, pp. 117\u2013126 (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 468\u2013485 (2012)","DOI":"10.1137\/1.9781611973099.41"},{"key":"19_CR19","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: Proceeding of SODA, pp. 982\u2013991 (2008)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Internet and Network Economics","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: improved approximation algorithms. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25510-6_15"},{"issue":"4","key":"19_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2014)","journal-title":"Math. Oper. Res."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kapralov, M.: Better bounds for matchings in the streaming model. In: Proceedings of SODA, pp. 1679\u20131697 (2013)","DOI":"10.1137\/1.9781611973105.121"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of STOC, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Lucier, B., Syrgkanis, V.: Greedy algorithms make efficient mechanisms. In: Proceedings of Conference on Economics and Computation, EC, pp. 221\u2013238 (2015)","DOI":"10.1145\/2764468.2764506"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Madry, A.: Navigating central path with electrical flows: from flows to matchings, and back. In: Proceedings of FOCS, pp. 253\u2013262 (2013)","DOI":"10.1109\/FOCS.2013.35"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Madry, A.: Computing maximum flow with augmenting electrical flows. In: Proceedings of FOCS, pp. 593\u2013602 (2016)","DOI":"10.1109\/FOCS.2016.70"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In: Proceedings of STOC, pp. 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. In: Proceedings of SODA, pp. 1285\u20131294 (2011)","DOI":"10.1137\/1.9781611973082.98"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-58747-9_4","volume-title":"Computer Science \u2013 Theory and Applications","author":"A McGregor","year":"2017","unstructured":"McGregor, A.: Graph sketching and streaming: new approaches for analyzing massive graphs. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 20\u201324. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_4"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proceedings of FOCS, pp. 248\u2013255 (2004)","DOI":"10.1007\/978-3-540-30140-0_48"},{"key":"19_CR32","unstructured":"Pena, N., Borodin, A.: On the limitations of deterministic de-randomizations for online bipartite matching and max-sat. CoRR, abs\/1608.03182 (2016)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-23719-5_4","volume-title":"Algorithms \u2013 ESA 2011","author":"M Poloczek","year":"2011","unstructured":"Poloczek, M.: Bounds on greedy algorithms for MAX\u00a0SAT. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 37\u201348. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_4"},{"key":"19_CR34","unstructured":"Poloczek, M., Schnitger, G., Williamson, D.P., Van Zuylen, A.: Greedy algorithms for the maximum satisfiability problem: simple algorithms and inapproximability bounds. SICOMP, accepted for publication"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Poloczek, M., Williamson, D.P.: An experimental evaluation of fast approximation algorithms for the maximum satisfiability problem. In: Proceedings of International Symposium on Experimental Algorithms, SEA, pp. 246\u2013261 (2016)","DOI":"10.1007\/978-3-319-38851-9_17"},{"issue":"3","key":"19_CR36","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01874391","volume":"1","author":"G Tinhofer","year":"1984","unstructured":"Tinhofer, G.: A probabilistic analysis of some greedy cardinality matching algorithms. Ann. Oper. Res. 1(3), 239\u2013254 (1984)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"19_CR37","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/s10878-007-9126-9","volume":"16","author":"Y Ye","year":"2008","unstructured":"Ye, Y., Borodin, A.: Priority algorithms for the subset-sum problem. J. Comb. Optim. 16(3), 198\u2013228 (2008)","journal-title":"J. Comb. Optim."}],"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-319-89441-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:59Z","timestamp":1710246059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}