{"id":"https://openalex.org/W2051294918","doi":"https://doi.org/10.1109/focs.2014.48","title":"Online Bipartite Matching in Offline Time","display_name":"Online Bipartite Matching in Offline Time","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2051294918","doi":"https://doi.org/10.1109/focs.2014.48","mag":"2051294918"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2014.48","doi":"https://doi.org/10.1109/focs.2014.48","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2014.48","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ruj.uj.edu.pl/xmlui/handle/item/5239","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038469350","display_name":"Bart\u0142omiej Bosek","orcid":"https://orcid.org/0000-0001-8756-3663","observed_orcids":["https://orcid.org/0000-0001-8756-3663"]},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bartlomiej Bosek","raw_affiliation_strings":["Theoretical Computer Science Department, Jagiellonian University, Krak\u00f3w, Poland","Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]},{"raw_affiliation_string":"Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086944842","display_name":"Dariusz Leniowski","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Dariusz Leniowski","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warszawa, Poland","Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4210087266","https://openalex.org/I4654613"]},{"raw_affiliation_string":"Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754","observed_orcids":["https://orcid.org/0000-0002-0907-3754"]},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warszawa, Poland","Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4210087266","https://openalex.org/I4654613"]},{"raw_affiliation_string":"Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078055627","display_name":"Anna Zych-Pawlewicz","orcid":"https://orcid.org/0000-0002-5361-8969","observed_orcids":["https://orcid.org/0000-0002-5361-8969"]},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Anna Zych","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warszawa, Poland","Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4210087266","https://openalex.org/I4654613"]},{"raw_affiliation_string":"Theor. Comput. Sci. Dept., Jagiellonian Univ., Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6331,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.94449537,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"384","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.5800999999046326,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.5800999999046326,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.39309999346733093,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.007000000216066837,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/online-bipartite-matching","display_name":"online bipartite matching","score":0.9869999885559082},{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":0.5740000009536743},{"id":"https://openalex.org/keywords/augmenting-paths","display_name":"augmenting paths","score":0.7409999966621399},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.6620000004768372},{"id":"https://openalex.org/keywords/approximate-matching","display_name":"approximate matching","score":0.7490000128746033},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"amortized analysis","score":0.828000009059906},{"id":"https://openalex.org/keywords/hopcroft-karp-algorithm","display_name":"Hopcroft-Karp algorithm","score":0.8650000095367432},{"id":"https://openalex.org/keywords/dynamic-graph-algorithms","display_name":"dynamic graph algorithms","score":0.48500001430511475}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8468545079231262},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.7973527312278748},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7562816143035889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6727217435836792},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6707190871238708},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5329585671424866},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5192439556121826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5143924355506897},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5088394284248352},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4194616973400116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41815829277038574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35773712396621704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3574739694595337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3329669237136841},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3034519553184509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2739484906196594},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1260291039943695},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/focs.2014.48","doi":"https://doi.org/10.1109/focs.2014.48","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2014.48","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/5239","doi":null,"is_oa":true,"landing_page_url":"http://ruj.uj.edu.pl/xmlui/handle/item/5239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publikacja pokonferencyjna"}],"best_oa_location":{"id":"pmh:oai:ruj.uj.edu.pl:item/5239","doi":null,"is_oa":true,"landing_page_url":"http://ruj.uj.edu.pl/xmlui/handle/item/5239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publikacja pokonferencyjna"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1501694180","https://openalex.org/W1507231083","https://openalex.org/W1582032289","https://openalex.org/W1712260008","https://openalex.org/W1769120835","https://openalex.org/W1983248819","https://openalex.org/W2011182146","https://openalex.org/W2031592993","https://openalex.org/W2050345497","https://openalex.org/W2098207812","https://openalex.org/W2103099082","https://openalex.org/W2116060765","https://openalex.org/W2121961571","https://openalex.org/W2128467914","https://openalex.org/W2133476289","https://openalex.org/W2146343385","https://openalex.org/W2146507303","https://openalex.org/W2155096670","https://openalex.org/W2157529519","https://openalex.org/W2162656786","https://openalex.org/W2913586686","https://openalex.org/W2964039920","https://openalex.org/W4392750738"],"related_works":["https://openalex.org/W126006422","https://openalex.org/W2403855565","https://openalex.org/W1978382073","https://openalex.org/W3206302766","https://openalex.org/W3000166930","https://openalex.org/W4287905780","https://openalex.org/W4286859947","https://openalex.org/W3011788258","https://openalex.org/W3208935973","https://openalex.org/W2051294918"],"abstract_inverted_index":{"This":[0,166,275],"paper":[1],"investigates":[2],"the":[3,52,62,96,104,119,136,172,182,205,210,239,267,277,283,310,315,343,347],"problem":[4,16],"of":[5,45,98,121,139,175,228,241,280,282,346],"maintaining":[6],"maximum":[7,137,268,286],"size":[8,64,269],"matchings":[9],"in":[10,33,86,143,155,209,271],"incremental":[11,216,263,323],"bipartite":[12,18],"graphs.":[13],"In":[14,47],"this":[15,87,156,249,340],"a":[17,43,69,78,81,125,179],"graph":[19],"G":[20],"between":[21,56,65,103],"n":[22,25],"clients":[23,31,53,100],"and":[24,37,58,217,294,324],"servers":[26,57],"is":[27],"revealed":[28],"online.":[29],"The":[30],"arrive":[32],"an":[34,74,130,168,262],"arbitrary":[35],"order":[36],"request":[38],"to":[39,42,54,60,80,94,109,194,243,304],"be":[40],"matched":[41],"subset":[44],"servers.":[46,105],"our":[48,302],"model":[49,88],"we":[50,72,92,107,123,202,214,237,259,308,319],"allow":[51],"switch":[55],"want":[59,93,108],"maximize":[61],"matching":[63,225,270,287,332],"them,":[66],"i.e.,":[67],"after":[68],"client":[70,79,162],"arrives":[71],"find":[73],"augmenting":[75,131,148],"path":[76,132],"from":[77],"free":[82],"server.":[83],"Our":[84],"goals":[85],"are":[89,101],"twofold.":[90],"First,":[91],"minimize":[95],"number":[97,120,138,174],"times":[99,140],"reallocated":[102],"Second,":[106],"give":[110,309],"fast":[111],"algorithms":[112,219,288,326],"that":[113,128,134,154,204,220,254,265,289,327,339],"recompute":[114],"such":[115],"reallocation.":[116],"As":[117],"for":[118,231,333],"changes,":[122,176],"propose":[124],"greedy":[126,250],"algorithm":[127,157,264],"chooses":[129],"\u03c0":[133,144],"minimizes":[135],"each":[141,158],"server":[142,159],"was":[145,290],"used":[146],"by":[147,187,248,255,292],"paths":[149,246],"so":[150],"far.":[151],"We":[152,252,300],"show":[153,215,253,320],"has":[160],"its":[161],"reassigned":[163],"O(\u221an)":[164],"times.":[165],"gives":[167,178],"O(n3/2)":[169],"bound":[170,207,313,341],"on":[171,314],"total":[173,227,272,312],"what":[177],"progress":[180],"towards":[181],"main":[183],"open":[184],"question":[185,240],"risen":[186],"Chaudhuri":[188],"et":[189],"al.":[190],"(INFOCOM'09)":[191],"who":[192],"asked":[193],"prove":[195],"O(n":[196],"log":[197],"n)":[198],"upper":[199],"bound.":[200],"Next,":[201],"argue":[203],"same":[206,311],"holds":[208],"decremental":[211,218,305,325],"case.":[212],"Moreover,":[213],"maintain":[221,328],"(1":[222,329],"-":[223,330],"\u03b5)-approximate":[224,331],"with":[226],"O(\u03b5-1n)":[229],"reallocations,":[230],"any":[232,334],"\u03b5":[233,335],">":[234,336],"0.":[235,337],"Finally,":[236],"address":[238],"how":[242],"efficiently":[244],"compute":[245],"given":[247,291],"algorithm.":[251],"introducing":[256],"proper":[257],"amortization":[258],"can":[260],"obtain":[261],"maintains":[266],"O(\u221anm)":[273],"time.":[274,317],"matches":[276,342],"running":[278,316,344],"time":[279,322,345],"one":[281],"fastest":[284,348],"static":[285,350],"Hopcroft":[293],"Karp":[295],"(SIAM":[296],"J.":[297],"Comput":[298],"'73).":[299],"extend":[301],"result":[303],"case":[306],"where":[307],"Additionally,":[318],"O(\u03b5-1m)":[321],"Observe":[338],"approximate":[349],"solution":[351],"as":[352],"well.":[353]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}