{"id":"https://openalex.org/W7133241324","doi":"https://doi.org/10.48550/arxiv.2602.24232","title":"Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion","display_name":"Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion","publication_year":2026,"publication_date":"2026-02-27","ids":{"openalex":"https://openalex.org/W7133241324","doi":"https://doi.org/10.48550/arxiv.2602.24232"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.24232","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046315164","display_name":"Nate Veldt","orcid":"https://orcid.org/0000-0002-0117-3304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Veldt, Nate","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101888113","display_name":"Thomas Stanley","orcid":"https://orcid.org/0000-0002-9618-1955"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stanley, Thomas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068202730","display_name":"Benjamin W. Priest","orcid":"https://orcid.org/0000-0003-3806-7369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Priest, Benjamin W.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084641058","display_name":"Trevor Steil","orcid":"https://orcid.org/0009-0001-1174-1846"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steil, Trevor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021147616","display_name":"Keita Iwabuchi","orcid":"https://orcid.org/0000-0002-9395-0843"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iwabuchi, Keita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127841981","display_name":"T. S. Jayram","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jayram, T. S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071607523","display_name":"Grace J. Li","orcid":"https://orcid.org/0000-0003-4058-5173"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Grace J.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089134354","display_name":"Geoffrey Sanders","orcid":"https://orcid.org/0000-0001-9145-1226"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanders, Geoffrey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4374000132083893,"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.4374000132083893,"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.13300000131130219,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.08529999852180481,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6730999946594238},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.65829998254776},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6086999773979187},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5491999983787537},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.492000013589859},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.41670000553131104}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6730999946594238},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.65829998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.637499988079071},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6086999773979187},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5491999983787537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5273000001907349},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3555000126361847},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2897999882698059},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26739999651908875},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.26589998602867126}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.24232","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.24232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.24232","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.24232","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.560110867023468,"display_name":"Life in Land","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":{"We":[0,95,156,175],"present":[1],"improved":[2],"learning-augmented":[3],"algorithms":[4],"for":[5,13,67,79,91,144,148,161],"finding":[6],"an":[7,16,107],"approximate":[8],"minimum":[9],"spanning":[10,48],"tree":[11],"(MST)":[12],"points":[14],"in":[15],"arbitrary":[17],"metric":[18,27,149],"space.":[19],"Our":[20,112],"work":[21],"follows":[22],"a":[23,36,46,65,76,88,97,119,181],"recent":[24],"framework":[25],"called":[26],"forest":[28,37,59],"completion":[29],"(MFC),":[30],"where":[31,84],"the":[32,58,80,92,135,139],"learned":[33],"input":[34],"is":[35,75,87,132,159],"that":[38,55,100],"must":[39],"be":[40],"given":[41],"additional":[42],"edges":[43,116],"to":[44,118,133,151],"form":[45],"full":[47],"tree.":[49],"Veldt":[50],"et":[51],"al.":[52],"(2025)":[53],"showed":[54],"optimally":[56],"completing":[57],"takes":[60],"$\u03a9(n^2)$":[61],"time,":[62],"but":[63,164],"designed":[64],"2.62-approximation":[66],"MFC":[68,110,145],"with":[69,180],"subquadratic":[70],"complexity.":[71],"The":[72],"same":[73],"method":[74,99],"$(2\u03b3+":[77],"1)$-approximation":[78],"original":[81],"MST":[82,150],"problem,":[83],"$\u03b3\\geq":[85],"1$":[86],"quality":[89],"parameter":[90],"initial":[93],"forest.":[94],"introduce":[96],"generalized":[98,173],"interpolates":[101],"between":[102],"this":[103,158],"prior":[104],"algorithm":[105,141],"and":[106,146,153],"optimal":[108],"$\u03a9(n^2)$-time":[109],"algorithm.":[111],"approach":[113],"considers":[114],"only":[115],"incident":[117],"growing":[120],"number":[121],"of":[122,129,138],"strategically":[123],"chosen":[124],"``representative''":[125],"points.":[126],"One":[127],"corollary":[128],"our":[130,172,177],"analysis":[131],"improve":[134],"approximation":[136],"factor":[137],"previous":[140],"from":[142],"2.62":[143],"$(2\u03b3+1)$":[147],"2":[152],"$2\u03b3$":[154],"respectively.":[155],"prove":[157],"tight":[160],"worst-case":[162],"instances,":[163],"we":[165],"still":[166],"obtain":[167],"better":[168],"instance-specific":[169],"approximations":[170],"using":[171],"method.":[174],"complement":[176],"theoretical":[178],"results":[179],"thorough":[182],"experimental":[183],"evaluation.":[184]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-03T00:00:00"}