{"id":"https://openalex.org/W2952720641","doi":"https://doi.org/10.1145/3326169","title":"Online Vertex-Weighted Bipartite Matching","display_name":"Online Vertex-Weighted Bipartite Matching","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2952720641","doi":"https://doi.org/10.1145/3326169","mag":"2952720641"},"language":"en","primary_location":{"id":"doi:10.1145/3326169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3326169","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Zhiyi Huang","orcid":"https://orcid.org/0000-0002-9046-5236"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Zhiyi Huang","raw_affiliation_strings":["Department of Computer Science, The University of Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0002-9046-5236","affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Hong Kong, China","institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032128738","display_name":"Zhihao Gavin Tang","orcid":"https://orcid.org/0000-0002-5094-1971"},"institutions":[{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihao Gavin Tang","raw_affiliation_strings":["ITCS, Shanghai University of Finance and Economics, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITCS, Shanghai University of Finance and Economics, China","institution_ids":["https://openalex.org/I181679659"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072788986","display_name":"Xiaowei Wu","orcid":"https://orcid.org/0000-0002-5766-2115"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Xiaowei Wu","raw_affiliation_strings":["Faculty of Computer Science, University of Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100349342","display_name":"Yuhao Zhang","orcid":"https://orcid.org/0000-0001-9330-1926"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yuhao Zhang","raw_affiliation_strings":["Department of Computer Science, The University of Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Hong Kong, China","institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":5.7602,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.963971,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.78431236743927},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7481260895729065},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.745701253414154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7447959184646606},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7130861878395081},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6218887567520142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5937013030052185},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5266002416610718},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3630197048187256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33688920736312866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25955042243003845},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.23041880130767822},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14229252934455872},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10627919435501099}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.78431236743927},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7481260895729065},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.745701253414154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7447959184646606},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7130861878395081},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6218887567520142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5937013030052185},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5266002416610718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3630197048187256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33688920736312866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25955042243003845},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.23041880130767822},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14229252934455872},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10627919435501099},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3326169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3326169","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W122351777","https://openalex.org/W205662698","https://openalex.org/W1496647032","https://openalex.org/W1522394790","https://openalex.org/W1542279226","https://openalex.org/W1970411956","https://openalex.org/W1988278843","https://openalex.org/W2011730242","https://openalex.org/W2029945631","https://openalex.org/W2048837158","https://openalex.org/W2074829830","https://openalex.org/W2079669094","https://openalex.org/W2104224720","https://openalex.org/W2107698341","https://openalex.org/W2131951207","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2295981146","https://openalex.org/W2401584318","https://openalex.org/W2463008130","https://openalex.org/W2531043207","https://openalex.org/W2571343094","https://openalex.org/W2777690836","https://openalex.org/W2798611120","https://openalex.org/W2802497182","https://openalex.org/W2949565166","https://openalex.org/W2963014036"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W2781235162","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2772037640","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":{"We":[0,53],"introduce":[1],"a":[2,18,68,123,130],"weighted":[3],"version":[4],"of":[5,21,81,91,133],"the":[6,24,45,50,56,79,82,88,92,100,116,137,148,151],"ranking":[7],"algorithm":[8,121],"by":[9,60],"Karp":[10],"et":[11,62],"al.":[12,63],"(STOC":[13],"1990),":[14],"and":[15,66,143],"we":[16],"prove":[17],"competitive":[19,102],"ratio":[20,103],"0.6534":[22],"for":[23,108],"vertex-weighted":[25,51],"online":[26,31,93,110,138,145],"bipartite":[27,111],"matching":[28,112],"problem":[29,113],"when":[30],"vertices":[32,128,139],"arrive":[33],"in":[34,49],"random":[35,41],"order.":[36],"Our":[37,120],"result":[38],"shows":[39],"that":[40,126],"arrivals":[42],"help":[43],"beating":[44],"1-1/e":[46,107],"barrier":[47],"even":[48],"case.":[52],"build":[54],"on":[55,78,87],"randomized":[57,117],"primal-dual":[58,118],"framework":[59],"Devanur":[61],"(SODA":[64],"2013)":[65],"design":[67],"two":[69],"dimensional":[70],"gain":[71],"sharing":[72],"function,":[73],"which":[74],"depends":[75],"not":[76],"only":[77],"rank":[80],"offline":[83,127],"vertex,":[84],"but":[85],"also":[86],"arrival":[89],"time":[90,141],"vertex.":[94],"To":[95],"our":[96],"knowledge,":[97],"this":[98],"is":[99],"first":[101],"strictly":[104],"larger":[105,131],"than":[106],"an":[109],"achieved":[114],"under":[115],"framework.":[119],"has":[122],"natural":[124],"interpretation":[125],"offer":[129,153],"portion":[132],"their":[134],"weights":[135],"to":[136],"as":[140],"increases,":[142],"each":[144],"vertex":[146],"matches":[147],"neighbor":[149],"with":[150],"highest":[152],"at":[154],"its":[155],"arrival.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}