{"id":"https://openalex.org/W4404193691","doi":"https://doi.org/10.1007/s00453-024-01282-9","title":"Optimal Algorithms for Online b-Matching with Variable Vertex Capacities","display_name":"Optimal Algorithms for Online b-Matching with Variable Vertex Capacities","publication_year":2024,"publication_date":"2024-11-08","ids":{"openalex":"https://openalex.org/W4404193691","doi":"https://doi.org/10.1007/s00453-024-01282-9"},"language":"lv","primary_location":{"id":"doi:10.1007/s00453-024-01282-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01282-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01282-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01282-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074909595","display_name":"Susanne Albers","orcid":"https://orcid.org/0000-0001-5848-5360"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103269021","display_name":"Sebastian Schubert","orcid":"https://orcid.org/0000-0002-3883-2297"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sebastian Schubert","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103269021"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.2084,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5784792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"87","issue":"2","first_page":"167","last_page":"190"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9952999949455261,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9829000234603882,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6226650476455688},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5569244027137756},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5144312977790833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5051999688148499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4941418468952179},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4356618821620941},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43322238326072693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3958234190940857},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3254089653491974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3213356137275696},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08949002623558044}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6226650476455688},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5569244027137756},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5144312977790833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5051999688148499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4941418468952179},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4356618821620941},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43322238326072693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3958234190940857},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3254089653491974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3213356137275696},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08949002623558044},{"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.1007/s00453-024-01282-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01282-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01282-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-024-01282-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-024-01282-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01282-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2363520468","display_name":"GRK 2201: Fortgeschrittene Optimierung in der vernetzten Wirtschaft","funder_award_id":"277991500","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"},{"id":"https://openalex.org/F4320323383","display_name":"Technische Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/02kkvpp62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4404193691.pdf","grobid_xml":"https://content.openalex.org/works/W4404193691.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1501694180","https://openalex.org/W1996313212","https://openalex.org/W2048837158","https://openalex.org/W2051294918","https://openalex.org/W2079669094","https://openalex.org/W2085938855","https://openalex.org/W2104224720","https://openalex.org/W2131951207","https://openalex.org/W2155096670","https://openalex.org/W2160702061","https://openalex.org/W2162656786","https://openalex.org/W2899702797","https://openalex.org/W2949565166","https://openalex.org/W2972193181","https://openalex.org/W2974337481","https://openalex.org/W3035275081","https://openalex.org/W3126370525","https://openalex.org/W4205598973","https://openalex.org/W4231916799","https://openalex.org/W4240320731","https://openalex.org/W4247154108","https://openalex.org/W4250340495","https://openalex.org/W4288346441","https://openalex.org/W4298227433","https://openalex.org/W4316652250","https://openalex.org/W4383557903"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W2064563243","https://openalex.org/W4250775169","https://openalex.org/W4301594054","https://openalex.org/W2794488505","https://openalex.org/W4309231192","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2295467472","https://openalex.org/W3046451053"],"abstract_inverted_index":{"Abstract":[0],"We":[1,109,165],"study":[2,98,155],"the":[3,54,86,89,99,112,138,149,156,168,178,194,240,249,261],"b-matching":[4,251,262],"problem,":[5],"which":[6],"generalizes":[7],"classical":[8],"online":[9,71,117],"matching":[10,58],"introduced":[11],"by":[12,136,160,211],"Karp,":[13,161],"Vazirani":[14,16,162],"and":[15,72,115,133,144,163,219,264],"(STOC":[17],"1990).":[18],"Consider":[19],"a":[20,44,47,129,174,205,256,266],"bipartite":[21],"graph":[22,226],"$$G=(S\\dot{\\cup":[23],"}R,E)$$":[24],"G":[25],"=":[26],"(":[27],"S":[28,42,235],"\u222a":[29],"\u02d9":[30],"R":[31,66],",":[32,52,191],"E":[33],")":[34],".":[35],"Every":[36],"vertex":[37],"$$s\\in":[38],"S$$":[39],"s":[40,51,210,214,233,237],"\u2208":[41,65,234],"is":[43,83,199],"server":[45,195,209],"with":[46,227],"capacity":[48,218],"$$b_s$$":[49,212],"b":[50,213,236],"indicating":[53],"number":[55],"of":[56,88,141,151,177,184,193,216],"possible":[57],"partners.":[59],"The":[60,81],"vertices":[61,215,238],"$$r\\in":[62],"R$$":[63],"r":[64],"are":[67],"requests":[68],"that":[69,111,167],"arrive":[70],"must":[73],"be":[74],"matched":[75],"immediately":[76],"to":[77,84,94,202,204,220,248],"an":[78,181],"eligible":[79],"server.":[80],"goal":[82],"maximize":[85],"cardinality":[87],"constructed":[90],"matching.":[91],"In":[92,148],"contrast":[93],"earlier":[95],"work,":[96],"we":[97,127,154,244,254],"general":[100],"setting":[101],"where":[102],"servers":[103],"may":[104],"have":[105],"arbitrary,":[106],"individual":[107],"capacities.":[108,196],"prove":[110,166],"most":[113],"natural":[114],"simple":[116],"algorithms":[118,153],"achieve":[119],"optimal":[120,182],"competitive":[121],"ratios.":[122],"As":[123],"for":[124,260],"deterministic":[125],"algorithms,":[126],"give":[128],"greedy":[130],"algorithm":[131,159],"RelativeBalance":[132],"analyze":[134],"it":[135,198],"extending":[137],"primal-dual":[139,267],"framework":[140],"Devanur,":[142],"Jain":[143],"Kleinberg":[145],"(SODA":[146],"2013).":[147],"area":[150],"randomized":[152],"celebrated":[157],"Ranking":[158,170,223],"Vazirani.":[164],"original":[169],"strategy,":[171],"simply":[172],"picking":[173],"random":[175],"permutation":[176],"servers,":[179],"achieves":[180],"competitiveness":[183],"$$1-1/e$$":[185],"1":[186,188],"-":[187],"/":[189],"e":[190],"independently":[192],"Hence":[197],"not":[200],"necessary":[201],"resort":[203],"reduction,":[206],"replacing":[207],"every":[208],"unit":[217],"then":[221],"run":[222],"on":[224,239],"this":[225,246],"$$\\sum":[228],"_{s\\in":[229],"S}":[230],"b_s$$":[231],"\u2211":[232],"left-hand":[241],"side.":[242],"Additionally,":[243],"extend":[245],"result":[247],"vertex-weighted":[250],"problem.":[252],"Technically,":[253],"formulate":[255],"new":[257],"configuration":[258],"LP":[259],"problem":[263],"conduct":[265],"analysis.":[268]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}