{"id":"https://openalex.org/W4281653671","doi":"https://doi.org/10.1145/3542700.3542712","title":"Technical Perspective: Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment","display_name":"Technical Perspective: Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment","publication_year":2022,"publication_date":"2022-05-31","ids":{"openalex":"https://openalex.org/W4281653671","doi":"https://doi.org/10.1145/3542700.3542712"},"language":"en","primary_location":{"id":"doi:10.1145/3542700.3542712","doi":"https://doi.org/10.1145/3542700.3542712","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3542700.3542712","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,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2","vabb-shw"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5045731304","display_name":"Nikos Mamoulis","orcid":"https://orcid.org/0000-0003-3423-4895","observed_orcids":["https://orcid.org/0000-0003-3423-4895"]},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Nikos Mamoulis","raw_affiliation_strings":["University of Ioannina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045731304"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"1","first_page":"50","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.43849998712539673,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.43849998712539673,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.3610999882221222,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.019099999219179153,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":0.9570000171661377},{"id":"https://openalex.org/keywords/bipartite-matching","display_name":"bipartite matching","score":0.7770000100135803},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.9269999861717224},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7900000214576721},{"id":"https://openalex.org/keywords/weighted-bipartite-graph","display_name":"weighted bipartite graph","score":0.6909999847412109},{"id":"https://openalex.org/keywords/stable-matching","display_name":"stable matching","score":0.75}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8016922473907471},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.7542991638183594},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.6888824701309204},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6331579685211182},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6268180012702942},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5676201581954956},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5078018307685852},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5047932863235474},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.47615715861320496},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.4414319694042206},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41489699482917786},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4144299030303955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34221702814102173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33500486612319946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3159136176109314},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17493078112602234},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.3542712","doi":"https://doi.org/10.1145/3542700.3542712","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3542700.3542712","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,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2","vabb-shw"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2031323533","https://openalex.org/W2079665167","https://openalex.org/W2222512263","https://openalex.org/W2523488852"],"related_works":["https://openalex.org/W2913183804","https://openalex.org/W2043509253","https://openalex.org/W2776930394","https://openalex.org/W2020777270","https://openalex.org/W1980128611","https://openalex.org/W1522068547","https://openalex.org/W3204141581","https://openalex.org/W2011087880","https://openalex.org/W1989070206","https://openalex.org/W4240927199"],"abstract_inverted_index":{"The":[0],"optimal":[1],"assignment":[2,91,131],"problem":[3,92],"is":[4,31,78,93,113],"a":[5,11,17,73,79,103,145],"classic":[6,86],"combinatorial":[7],"optimization":[8,137],"problem.":[9,84,124],"Given":[10],"set":[12,18],"of":[13,20,47,117,129,151,168],"n":[14,56,109],"agents":[15,152],"A,":[16],"T":[19],"m":[21,58],"tasks,":[22],"and":[23,38,59,159],"an":[24,44,141],"n\u00d7m":[25],"cost":[26,46,106],"matrix":[27],"C,":[28],"the":[29,34,48,64,68,90,94,114,130,136,149,166],"objective":[30,138],"to":[32],"find":[33],"matching":[35,66,83],"between":[36],"A":[37,85],"T,":[39],"which":[40,101,133,154],"minimizes":[41],"or":[42,173],"maximizes":[43],"aggregate":[45,142],"assigned":[49],"agent-task":[50],"pairs.":[51],"In":[52],"its":[53],"standard":[54],"definition,":[55],"=":[57,110],"we":[60],"are":[61,126,163],"looking":[62],"for":[63,88,122,170],"1-to-1":[65],"with":[67],"minimum":[69],"total":[70],"cost.":[71],"From":[72],"graph":[74,82],"theory":[75],"perspective,":[76],"this":[77,112,123],"weighted":[80],"bipartite":[81],"algorithm":[87,96,121],"solving":[89],"Hungarian":[95],"(a.k.a.":[97],"Kuhn-Munkres":[98],"algorithm)":[99],"[3],":[100],"bears":[102],"O(n3)":[104],"computational":[105],"(assuming":[107],"that":[108],"m);":[111],"best":[115],"run-time":[116],"any":[118],"strongly":[119],"polynomial":[120],"There":[125],"many":[127],"variants":[128],"problem,":[132],"differ":[134],"in":[135,160],"(i.e.,":[139],"minimize/maximize":[140],"cost,":[143],"achieve":[144],"stable":[146],"matching,":[147],"maximize":[148],"number":[150,167],"matched":[153],"their":[155],"top":[156],"preferences,":[157],"etc.)":[158],"whether":[161],"there":[162],"constraints":[164],"on":[165],"matches":[169],"each":[171],"agent":[172],"task.":[174]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2022-06-13T00:00:00"}