{"id":"https://openalex.org/W7224914792","doi":"https://doi.org/10.48550/arxiv.2610.40569","title":"The Tight Competitive Ratio of Greedy for Online Steiner Forest","display_name":"The Tight Competitive Ratio of Greedy for Online Steiner Forest","publication_year":2026,"publication_date":"2026-10-29","ids":{"openalex":"https://openalex.org/W7224914792","doi":"https://doi.org/10.48550/arxiv.2610.40569"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.40569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40569","pdf_url":"https://arxiv.org/pdf/2610.40569","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.40569","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092855060","display_name":"Iman Gholami","orcid":"https://orcid.org/0009-0007-4225-1608","observed_orcids":["https://orcid.org/0009-0007-4225-1608"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gholami, Iman","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114617515","display_name":"Ilya Hajiaghayi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hajiaghayi, Ilya","raw_affiliation_strings":["Takoma Park Middle School"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Takoma Park Middle School","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":"https://orcid.org/0000-0003-4842-0533","observed_orcids":["https://orcid.org/0000-0003-4842-0533"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hajiaghayi, MohammadTaghi","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092086111","display_name":"Peyman Jabbarzade","orcid":"https://orcid.org/0000-0002-5413-2231","observed_orcids":["https://orcid.org/0000-0002-5413-2231"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jabbarzade, Peyman","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9818999767303467,"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.9818999767303467,"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.015699999406933784,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/competitive-ratio","display_name":"competitive ratio","score":0.8270000219345093},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9850000143051147},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.7419999837875366},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5080000162124634},{"id":"https://openalex.org/keywords/tight-bounds","display_name":"tight bounds","score":0.40400001406669617},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.41600000858306885},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.6959999799728394},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8072999715805054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7365000247955322},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7052000164985657},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6935999989509583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.626800000667572},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6018000245094299},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5839999914169312},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5601000189781189},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4765999913215637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4235000014305115},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3880000114440918},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3028999865055084},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2849999964237213},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26489999890327454},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25859999656677246},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.40569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40569","pdf_url":"https://arxiv.org/pdf/2610.40569","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.40569","doi":"https://doi.org/10.48550/arxiv.2610.40569","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.40569","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.40569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40569","pdf_url":"https://arxiv.org/pdf/2610.40569","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224914792.pdf","grobid_xml":"https://content.openalex.org/works/W7224914792.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3216580849","https://openalex.org/W1557629339","https://openalex.org/W1517384480","https://openalex.org/W2260641052","https://openalex.org/W2046699917","https://openalex.org/W2070352298","https://openalex.org/W2271728747","https://openalex.org/W4406141807","https://openalex.org/W1594159683","https://openalex.org/W3092788214"],"abstract_inverted_index":{"The":[0,30],"online":[1,114,174],"Steiner":[2,115,177],"Forest":[3],"problem":[4,10],"is":[5,59,70,120],"a":[6,18,39,91,139,160],"fundamental":[7],"network":[8],"design":[9],"in":[11],"which":[12],"terminal":[13,36,74],"pairs":[14],"arrive":[15],"one":[16],"at":[17],"time":[19],"and":[20,51,62,78,137,156,158,170],"an":[21,64,83,128],"algorithm":[22,33,58,112,169,175],"must":[23],"irrevocably":[24],"purchase":[25],"edges":[26,47],"connecting":[27],"each":[28,35],"pair.":[29],"natural":[31],"greedy":[32,89,111,168],"connects":[34],"pair":[37],"by":[38],"shortest":[40],"path":[41],"after":[42],"making":[43],"all":[44],"previously":[45],"purchased":[46],"free.":[48],"Awerbuch,":[49,154],"Azar,":[50,155],"Bartal":[52,157],"(SODA":[53,80],"1996)":[54],"proved":[55],"that":[56,118],"this":[57,102],"$O(log^2":[60],"k)$-competitive":[61],"conjectured":[63],"$O(log":[65,150],"k)$":[66,151,164],"bound,":[67],"where":[68],"$k$":[69],"the":[71,97,106,110,149,167,171],"number":[72],"of":[73,94,109,153],"pairs.":[75],"Bamas,":[76],"Drygala,":[77],"Maggiori":[79],"2022)":[81],"obtained":[82],"$O(\\log":[84],"\\NumPairs\\log\\log":[85],"\\NumPairs)$":[86],"bound":[87,133],"for":[88,113,134,176],"on":[90],"restricted":[92],"class":[93],"inputs,":[95],"leaving":[96],"general":[98],"case":[99],"open.":[100],"In":[101],"paper,":[103],"we":[104,126],"resolve":[105],"competitive":[107],"ratio":[108],"Forest,":[116],"proving":[117],"it":[119],"tightly":[121],"$\u0398(log(k)":[122],"log":[123,130,142,163],"log(k))$.":[124],"Specifically,":[125],"establish":[127,159],"$O(log(k)":[129],"log(k))$":[131,143],"upper":[132],"arbitrary":[135],"instances":[136],"construct":[138],"matching":[140],"$\u03a9(log(k)":[141],"lower":[144],"bound.":[145],"Our":[146],"results":[147],"refute":[148],"conjecture":[152],"tight":[161],"$\u0398(log":[162],"separation":[165],"between":[166],"best":[172],"possible":[173],"Forest.":[178]},"counts_by_year":[],"updated_date":"2026-11-02T09:45:03.842371","created_date":"2026-10-31T00:00:00"}