{"id":"https://openalex.org/W4281780366","doi":"https://doi.org/10.1145/3542700.3542713","title":"Bipartite Matching","display_name":"Bipartite Matching","publication_year":2022,"publication_date":"2022-05-31","ids":{"openalex":"https://openalex.org/W4281780366","doi":"https://doi.org/10.1145/3542700.3542713"},"language":"en","primary_location":{"id":"doi:10.1145/3542700.3542713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3542700.3542713","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"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 SIGMOD Record","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":"https://openalex.org/A5000634517","display_name":"Tenindra Abeywickrama","orcid":"https://orcid.org/0000-0003-1053-2193"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tenindra Abeywickrama","raw_affiliation_strings":["Grab Holdings Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Grab Holdings Inc","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113770951","display_name":"Victor Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Victor Liang","raw_affiliation_strings":["Grab Holdings Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Grab Holdings Inc","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077593594","display_name":"Kian\u2010Lee Tan","orcid":"https://orcid.org/0000-0001-9315-4057"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kian-Lee Tan","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2828,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.46732429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"51","issue":"1","first_page":"51","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"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.986299991607666,"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.8694431781768799},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7591559886932373},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7190372943878174},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7185326814651489},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.674274206161499},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6608369946479797},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6181379556655884},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.599187433719635},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5692405104637146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5015039443969727},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4960983693599701},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4764847457408905},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.4389265775680542},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41388845443725586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38603901863098145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.364515095949173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16915538907051086},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11959949135780334}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8694431781768799},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7591559886932373},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7190372943878174},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7185326814651489},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.674274206161499},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6608369946479797},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6181379556655884},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.599187433719635},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5692405104637146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5015039443969727},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4960983693599701},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4764847457408905},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.4389265775680542},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41388845443725586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38603901863098145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.364515095949173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16915538907051086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11959949135780334},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3542700.3542713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3542700.3542713","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"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 SIGMOD Record","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2014889099","https://openalex.org/W2055536684","https://openalex.org/W2076554191","https://openalex.org/W2079168081","https://openalex.org/W2125708920","https://openalex.org/W2141461755","https://openalex.org/W2149342630","https://openalex.org/W2160080073","https://openalex.org/W2163318198","https://openalex.org/W2254589950","https://openalex.org/W2523488852","https://openalex.org/W2742211145","https://openalex.org/W2803846618","https://openalex.org/W2808810245","https://openalex.org/W2914844844","https://openalex.org/W3036969273","https://openalex.org/W3037451370","https://openalex.org/W3139934801","https://openalex.org/W4213060883","https://openalex.org/W6689029123","https://openalex.org/W6986156783"],"related_works":["https://openalex.org/W2028174200","https://openalex.org/W3202113264","https://openalex.org/W1519280321","https://openalex.org/W66562208","https://openalex.org/W2341912396","https://openalex.org/W1964772317","https://openalex.org/W2125708920","https://openalex.org/W2136468415","https://openalex.org/W2913183804","https://openalex.org/W2370475393"],"abstract_inverted_index":{"The":[0],"Kuhn-Munkres":[1],"(KM)":[2],"algorithm":[3,9,174],"is":[4,11,175,182],"a":[5,28,127],"classical":[6],"combinatorial":[7],"optimization":[8],"that":[10,130],"widely":[12],"used":[13],"for":[14],"minimum":[15],"cost":[16,78,152],"bipartite":[17,52,63],"matching":[18],"in":[19,100,185],"many":[20],"real-world":[21,124,167],"applications,":[22],"such":[23],"as":[24,99,139,161],"transportation.":[25],"For":[26],"example,":[27],"ride-hailing":[29],"service":[30],"may":[31],"use":[32],"it":[33],"to":[34,41,43,106,133,156,178],"find":[35],"the":[36,45,58,74,81,92,95,101,150,157],"optimal":[37,68,96],"assignment":[38,97,154],"of":[39,76,94,103,111,153],"drivers":[40,105],"passengers":[42,107],"minimize":[44],"overall":[46,82,151],"wait":[47],"time.":[48,84],"Typically,":[49],"given":[50],"two":[51],"sets,":[53],"this":[54,179],"process":[55],"involves":[56,109],"computing":[57],"edge":[59,77,87,136],"costs":[60,137],"between":[61],"all":[62],"pairs":[64],"and":[65,170,181],"finding":[66],"an":[67,142],"matching.":[69],"However,":[70],"existing":[71],"works":[72],"overlook":[73],"impact":[75],"computation":[79,88,93,110],"on":[80,117,165],"running":[83],"In":[85],"reality,":[86],"often":[89],"significantly":[90,148],"outweighs":[91],"itself,":[98],"case":[102],"assigning":[104],"which":[108],"expensive":[112],"graph":[113],"shortest":[114],"paths.":[115],"Following":[116],"from":[118],"this,":[119],"we":[120,162],"also":[121],"observe":[122],"common":[123],"settings":[125,187],"exhibit":[126],"useful":[128],"property":[129],"allows":[131],"us":[132],"incrementally":[134],"compute":[135],"only":[138],"required":[140],"using":[141],"inexpensive":[143],"lower-bound":[144],"heuristic.":[145],"This":[146],"technique":[147],"reduces":[149],"compared":[155],"original":[158],"KM":[159],"algorithm,":[160],"demonstrate":[163],"experimentally":[164],"multiple":[166],"data":[168],"sets":[169],"workloads.":[171],"Moreover,":[172],"our":[173],"not":[176],"limited":[177],"domain":[180],"potentially":[183],"applicable":[184],"other":[186],"where":[188],"lower-bounding":[189],"heuristics":[190],"are":[191],"available.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2022-06-13T00:00:00"}