{"id":"https://openalex.org/W2787900023","doi":"https://doi.org/10.1007/s00224-017-9838-x","title":"Shortest Augmenting Paths for Online Matchings on Trees","display_name":"Shortest Augmenting Paths for Online Matchings on Trees","publication_year":2018,"publication_date":"2018-01-24","ids":{"openalex":"https://openalex.org/W2787900023","doi":"https://doi.org/10.1007/s00224-017-9838-x","mag":"2787900023"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-017-9838-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-017-9838-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-017-9838-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","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/s00224-017-9838-x.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038469350","display_name":"Bart\u0142omiej Bosek","orcid":"https://orcid.org/0000-0001-8756-3663"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Bart\u0142omiej Bosek","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086944842","display_name":"Dariusz Leniowski","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Dariusz Leniowski","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210087266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210087266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078055627","display_name":"Anna Zych-Pawlewicz","orcid":"https://orcid.org/0000-0002-5361-8969"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Anna Zych-Pawlewicz","raw_affiliation_strings":["Institute of Computer Science, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038469350"],"corresponding_institution_ids":["https://openalex.org/I126596746"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3901,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63962025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"62","issue":"2","first_page":"337","last_page":"348"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.8101106882095337},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7839965224266052},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6418216824531555},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6284416913986206},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.60959792137146},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5999159812927246},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5944700837135315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5893312096595764},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5315971970558167},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4727792739868164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4484970271587372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4003055989742279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.251440167427063}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8101106882095337},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7839965224266052},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6418216824531555},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6284416913986206},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.60959792137146},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5999159812927246},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5944700837135315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5893312096595764},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5315971970558167},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4727792739868164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4484970271587372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4003055989742279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.251440167427063},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00224-017-9838-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-017-9838-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-017-9838-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/51539","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/51539","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"artyku\u0142 w czasopi\u015bmie"}],"best_oa_location":{"id":"doi:10.1007/s00224-017-9838-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-017-9838-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-017-9838-x.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1512887187","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G5365428333","display_name":null,"funder_award_id":"2013/11/D/ST6/03100","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2787900023.pdf","grobid_xml":"https://content.openalex.org/works/W2787900023.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1501694180","https://openalex.org/W1582032289","https://openalex.org/W1769120835","https://openalex.org/W1983248819","https://openalex.org/W2018804864","https://openalex.org/W2031592993","https://openalex.org/W2051294918","https://openalex.org/W2121961571","https://openalex.org/W2133476289","https://openalex.org/W2146343385","https://openalex.org/W2149342630","https://openalex.org/W2155096670","https://openalex.org/W2253984302","https://openalex.org/W2296273994","https://openalex.org/W2610729871","https://openalex.org/W4247656554"],"related_works":["https://openalex.org/W2968037521","https://openalex.org/W2357469710","https://openalex.org/W2461841679","https://openalex.org/W2596165142","https://openalex.org/W69176915","https://openalex.org/W2118779360","https://openalex.org/W196138040","https://openalex.org/W2461366636","https://openalex.org/W2473132644","https://openalex.org/W2151412766"],"abstract_inverted_index":{"The":[0],"shortest":[1,114],"augmenting":[2,115,131,171],"path":[3],"(Sap)":[4],"algorithm":[5,39],"is":[6,58,65,85,136,149],"one":[7,93],"of":[8,104,129,170],"the":[9,14,34,41,68,109,126,167],"most":[10],"classical":[11],"approaches":[12],"to":[13],"maximum":[15,18,42],"matching":[16,71,111],"and":[17,25],"flow":[19,43],"problems,":[20],"e.g.,":[21],"using":[22,113],"it":[23,48],"Edmonds":[24],"Karp":[26],"(J.":[27],"ACM":[28],"19(2),":[29],"248\u2013264":[30],"1972)":[31],"have":[32],"shown":[33],"first":[35],"strongly":[36],"polynomial":[37],"time":[38],"for":[40,52,152,166,173],"problem.":[44,72],"Quite":[45],"astonishingly,":[46],"although":[47],"has":[49],"been":[50],"studied":[51],"many":[53],"years":[54],"already,":[55],"this":[56,74,105,155],"approach":[57],"far":[59],"from":[60,95],"being":[61,86],"fully":[62],"understood.":[63],"This":[64],"exemplified":[66],"by":[67,112,120,134],"online":[69],"bipartite":[70,77],"In":[73,154],"problem":[75],"a":[76],"graph":[78],"G":[79],"=":[80],"(W":[81],"\u228e":[82],"B,":[83],"E)":[84],"revealed":[87],"online,":[88],"i.e.,":[89],"in":[90],"each":[91],"round":[92],"vertex":[94,106],"B":[96],"with":[97],"its":[98],"incident":[99],"edges":[100],"arrives.":[101],"After":[102],"arrival":[103],"we":[107,157],"augment":[108],"current":[110],"path.":[116],"It":[117],"was":[118],"conjectured":[119],"Chaudhuri":[121],"et":[122],"al.":[123],"(INFOCOM\u201909)":[124],"that":[125],"total":[127,168],"length":[128,169],"all":[130],"paths":[132,172],"found":[133],"Sap":[135],"$\\mathcal":[137,147,160],"{O}(n":[138,161],"\\log":[139,162],"n)$":[140],".":[141],"However,":[142],"no":[143],"better":[144],"bound":[145,165],"than":[146],"{O}(n^{2})$":[148],"known":[150],"even":[151],"trees.":[153,174],"paper":[156],"prove":[158],"an":[159],"^{2}n)$":[163],"upper":[164]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}