{"id":"https://openalex.org/W4284663723","doi":"https://doi.org/10.1145/3529228","title":"A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching","display_name":"A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching","publication_year":2022,"publication_date":"2022-07-07","ids":{"openalex":"https://openalex.org/W4284663723","doi":"https://doi.org/10.1145/3529228"},"language":"en","primary_location":{"id":"doi:10.1145/3529228","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3529228","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3529228","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3529228","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077653773","display_name":"Eugenio Angriman","orcid":"https://orcid.org/0000-0002-3160-1509"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eugenio Angriman","raw_affiliation_strings":["Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3160-1509","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040484838","display_name":"Micha\u0142 Boro\u0144","orcid":"https://orcid.org/0000-0003-1695-4880"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Boro\u0144","raw_affiliation_strings":["Visiting scholar at Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1695-4880","affiliations":[{"raw_affiliation_string":"Visiting scholar at Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7769-726X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":0.2679,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55044255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"41"},"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.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/matching","display_name":"Matching (statistics)","score":0.6667523384094238},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6165106892585754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5949098467826843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5581515431404114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.557707667350769},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5444915294647217},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.515200674533844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4720132052898407},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4206702709197998},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41420426964759827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3114970326423645},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21082058548927307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08907002210617065}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6667523384094238},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6165106892585754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5949098467826843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5581515431404114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.557707667350769},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5444915294647217},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.515200674533844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4720132052898407},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4206702709197998},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41420426964759827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3114970326423645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21082058548927307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08907002210617065},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3529228","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3529228","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3529228","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3529228","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3529228","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3529228","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.550000011920929}],"awards":[{"id":"https://openalex.org/G3426663184","display_name":null,"funder_award_id":"ME 3619/3-2 and ME 3619/4-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4707760216","display_name":null,"funder_award_id":"ME 3619/3-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G73367682","display_name":null,"funder_award_id":"ME 3619/4-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4284663723.pdf","grobid_xml":"https://content.openalex.org/works/W4284663723.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1150057154","https://openalex.org/W1482680420","https://openalex.org/W1485041102","https://openalex.org/W1514707655","https://openalex.org/W1528711087","https://openalex.org/W1582032289","https://openalex.org/W1769120835","https://openalex.org/W1869723204","https://openalex.org/W1983248819","https://openalex.org/W1999848117","https://openalex.org/W2003813631","https://openalex.org/W2021642912","https://openalex.org/W2024106841","https://openalex.org/W2024607148","https://openalex.org/W2054420170","https://openalex.org/W2076736619","https://openalex.org/W2080090262","https://openalex.org/W2096413587","https://openalex.org/W2125690626","https://openalex.org/W2130257319","https://openalex.org/W2133476289","https://openalex.org/W2138508044","https://openalex.org/W2165753192","https://openalex.org/W2244920958","https://openalex.org/W2295258302","https://openalex.org/W2341465683","https://openalex.org/W2544746413","https://openalex.org/W2762990162","https://openalex.org/W2772608424","https://openalex.org/W2782000683","https://openalex.org/W2800650906","https://openalex.org/W2809141942","https://openalex.org/W2810035363","https://openalex.org/W2954172701","https://openalex.org/W2963017687","https://openalex.org/W2963794747","https://openalex.org/W2964007887","https://openalex.org/W2964039920","https://openalex.org/W2972115413","https://openalex.org/W2996312905","https://openalex.org/W3036650104","https://openalex.org/W3082437107","https://openalex.org/W3101104511","https://openalex.org/W4211172364","https://openalex.org/W4232907588","https://openalex.org/W4233756358","https://openalex.org/W4235789583","https://openalex.org/W4390575860"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2058438338","https://openalex.org/W2950751300","https://openalex.org/W4301272096","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Matching":[0],"is":[1,237],"a":[2,48,74,107,113,153,172,200,213,225,246],"popular":[3],"combinatorial":[4],"optimization":[5],"problem":[6,104,128],"with":[7,249],"numerous":[8],"applications":[9],"in":[10,26,118,134,240],"both":[11],"commercial":[12],"and":[13,148,170,187,194,206],"scientific":[14],"fields.":[15],"Computing":[16],"optimal":[17,71],"matchings":[18],"w.r.t.":[19],"cardinality":[20],"or":[21,85],"weight":[22],"can":[23,32],"be":[24],"done":[25],"polynomial":[27],"time;":[28],"still,":[29],"this":[30,98,127],"task":[31],"become":[33],"infeasible":[34],"for":[35,47,89,126,180,224],"very":[36],"large":[37],"networks.":[38],"Thus,":[39],"several":[40],"approximation":[41,68,209],"algorithms":[42,63,125],"that":[43,57,64,141,157,234],"trade":[44],"solution":[45],"quality":[46],"faster":[49,239],"running":[50,215],"time":[51,136,216],"have":[52,77],"been":[53,78,95,166],"proposed.":[54],"For":[55,242],"networks":[56],"change":[58],"over":[59],"time,":[60],"fully":[61,86,119],"dynamic":[62,87,120],"efficiently":[65],"maintain":[66],"an":[67],"of":[69,105,112,123,143,152,203,217,269],"the":[70,103,139,150,184],"matching":[72,93,116],"after":[73],"graph":[75,227],"update":[76],"introduced":[79],"as":[80],"well.":[81],"However,":[82],"no":[83],"semi-":[84],"algorithm":[88,179,186,205,236],"(approximate)":[90],"maximum":[91,114],"weighted":[92,115],"has":[94,164],"implemented.":[96],"In":[97],"article,":[99],"we":[100],"focus":[101],"on":[102,161,183],"maintaining":[106],"\\(":[108,175,218,259,263,270,279,283],"1/2":[109,176],"\\)":[110,177,223,261,265,272,281,285],"-approximation":[111,178],"(MWM)":[117],"graphs.":[121],"Limitations":[122],"existing":[124],"are":[129,255,275],"(i)":[130],"high":[131],"constant":[132],"factors":[133],"their":[135,158],"complexity,":[137],"(ii)":[138],"fact":[140],"none":[142],"them":[144],"supports":[145],"batch":[146],"updates,":[147],"(iii)":[149],"lack":[151],"practical":[154],"implementation,":[155],"meaning":[156],"actual":[159],"performance":[160],"real-world":[162],"graphs":[163],"not":[165],"investigated.":[167],"We":[168,198],"propose":[169],"implement":[171],"new":[173],"batch-dynamic":[174],"MWM":[181],"based":[182],"Suitor":[185,251],"its":[188,208],"local":[189],"edge":[190,273],"domination":[191],"strategy":[192],"[Manne":[193],"Halappanavar,":[195],"IPDPS":[196],"2014].":[197],"provide":[199],"detailed":[201],"analysis":[202],"our":[204,229,235],"prove":[207],"guarantee.":[210],"Despite":[211],"having":[212],"worst-case":[214],"\\mathcal":[219],"{O}(n":[220],"+":[221],"m)":[222],"single":[226],"update,":[228],"extensive":[230],"experimental":[231],"evaluation":[232],"shows":[233],"much":[238],"practice.":[241],"example,":[243],"compared":[244],"to":[245,258,262,278,282],"static":[247],"recomputation":[248],"sequential":[250],",":[252],"single-edge":[253],"updates":[254,274],"handled":[256,276],"up":[257,277],"10^5\\times":[260],"10^6\\times":[264],"faster,":[266],"while":[267],"batches":[268],"10^4":[271],"10^2\\times":[280],"10^3\\times":[284],"faster.":[286]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}