{"id":"https://openalex.org/W7160927466","doi":"https://doi.org/10.48550/arxiv.2605.09821","title":"Online Steiner Forest with Recourse","display_name":"Online Steiner Forest with Recourse","publication_year":2026,"publication_date":"2026-05-10","ids":{"openalex":"https://openalex.org/W7160927466","doi":"https://doi.org/10.48550/arxiv.2605.09821"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.09821","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.09821","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135927777","display_name":"Yaowei Long","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Long, Yaowei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065331345","display_name":"Sepideh Mahabadi","orcid":"https://orcid.org/0000-0001-5004-8991"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahabadi, Sepideh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070665261","display_name":"Sherry Sarkar","orcid":"https://orcid.org/0009-0006-9994-1733"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarkar, Sherry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076652577","display_name":"Jakub Tarnawski","orcid":"https://orcid.org/0000-0001-6175-5827"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tarnawski, Jakub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9050999879837036,"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":0.9050999879837036,"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.028699999675154686,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.019099999219179153,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7027999758720398},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6344000101089478},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5612999796867371},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49869999289512634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49380001425743103},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.4408000111579895},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2904999852180481}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7027999758720398},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6344000101089478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5866000056266785},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5612999796867371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5009999871253967},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49869999289512634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49380001425743103},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40639999508857727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3398999869823456},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30880001187324524},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.27219998836517334},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.2623000144958496},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.09821","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.09821","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6143051981925964,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,70],"the":[1,43,62,75],"online":[2,23,81],"Steiner":[3,82],"forest":[4],"problem":[5],"we":[6,51,73],"are":[7,26,52],"given":[8],"a":[9,13,30,90],"graph":[10],"$G$,":[11],"and":[12,93,103],"sequence":[14],"of":[15,77,98],"terminal":[16],"pairs":[17,44],"$(u_i,v_i)$":[18],"which":[19,34],"arrive":[20],"in":[21,33],"an":[22,86,95],"fashion.":[24],"We":[25,84],"asked":[27],"to":[28,39,55],"maintain":[29],"low-cost":[31],"subgraph":[32],"each":[35],"$u_i$":[36],"is":[37,67],"connected":[38],"$v_i$":[40],"for":[41,80],"all":[42],"that":[45,88],"have":[46],"arrived":[47],"so":[48],"far.":[49],"If":[50],"not":[53],"allowed":[54],"delete":[56],"edges":[57,107],"from":[58],"our":[59],"solution,":[60],"then":[61],"best":[63],"possible":[64],"competitive":[65],"ratio":[66],"$\u0398(\\log":[68],"n)$.":[69],"this":[71],"work,":[72],"initiate":[74],"study":[76],"low-recourse":[78],"algorithms":[79],"forest.":[83],"give":[85],"algorithm":[87],"maintains":[89],"constant-competitive":[91],"solution":[92],"has":[94],"amortized":[96],"recourse":[97],"$O(\\log":[99,105],"n)$,":[100],"i.e.,":[101],"inserts":[102],"deletes":[104],"n)$":[106],"per":[108],"demand":[109],"on":[110],"average.":[111]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}