{"id":"https://openalex.org/W4411319933","doi":"https://doi.org/10.1145/3717823.3718312","title":"Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs","display_name":"Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319933","doi":"https://doi.org/10.1145/3717823.3718312"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003923315","display_name":"Hsien-Chih Chang","orcid":"https://orcid.org/0000-0001-6714-7988"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsien-Chih Chang","raw_affiliation_strings":["Dartmouth College, Hanover, USA"],"raw_orcid":"https://orcid.org/0000-0001-6714-7988","affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067955248","display_name":"Jonathan Conroy","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Conroy","raw_affiliation_strings":["Dartmouth College, Hanover, USA"],"raw_orcid":"https://orcid.org/0009-0006-8487-9682","affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050273950","display_name":"Hung Le","orcid":"https://orcid.org/0000-0001-8223-9944"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hung Le","raw_affiliation_strings":["University of Massachusetts at Amherst, Amherst, USA"],"raw_orcid":"https://orcid.org/0000-0001-8223-9944","affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, Amherst, USA","institution_ids":["https://openalex.org/I177605424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Solomon","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":"https://orcid.org/0000-0003-2254-5100","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050147589","display_name":"Cuong Than","orcid":"https://orcid.org/0000-0001-7350-331X"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cuong Than","raw_affiliation_strings":["University of Massachusetts at Amherst, Amherst, USA"],"raw_orcid":"https://orcid.org/0000-0001-7350-331X","affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, Amherst, USA","institution_ids":["https://openalex.org/I177605424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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":"2257","last_page":"2268"},"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.9998999834060669,"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.9998999834060669,"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.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/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/computer-science","display_name":"Computer science","score":0.6551797986030579},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6175245642662048},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5883210301399231},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.575799286365509},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.560343325138092},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.48219338059425354},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45189785957336426},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.42559778690338135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3565617799758911},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32829636335372925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2630196511745453},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25730663537979126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21658754348754883},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20344963669776917}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6551797986030579},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6175245642662048},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5883210301399231},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.575799286365509},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.560343325138092},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.48219338059425354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45189785957336426},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.42559778690338135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3565617799758911},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32829636335372925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2630196511745453},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25730663537979126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21658754348754883},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20344963669776917},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3717823.3718312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":75,"referenced_works":["https://openalex.org/W1491309030","https://openalex.org/W1492516078","https://openalex.org/W1527483699","https://openalex.org/W1587867115","https://openalex.org/W1601859867","https://openalex.org/W1913170890","https://openalex.org/W1981870397","https://openalex.org/W1991530421","https://openalex.org/W1992550125","https://openalex.org/W1995963690","https://openalex.org/W2002041206","https://openalex.org/W2005580106","https://openalex.org/W2022407168","https://openalex.org/W2036114412","https://openalex.org/W2041167985","https://openalex.org/W2045134120","https://openalex.org/W2045446569","https://openalex.org/W2053578961","https://openalex.org/W2054011861","https://openalex.org/W2057994027","https://openalex.org/W2063048655","https://openalex.org/W2063624401","https://openalex.org/W2065248207","https://openalex.org/W2075022748","https://openalex.org/W2077824753","https://openalex.org/W2079875328","https://openalex.org/W2093521781","https://openalex.org/W2102560346","https://openalex.org/W2104116126","https://openalex.org/W2116405248","https://openalex.org/W2120176025","https://openalex.org/W2131648596","https://openalex.org/W2142266972","https://openalex.org/W2149272173","https://openalex.org/W2152306920","https://openalex.org/W2152383935","https://openalex.org/W2154833764","https://openalex.org/W2167838689","https://openalex.org/W2211624051","https://openalex.org/W2244611312","https://openalex.org/W2293001982","https://openalex.org/W2493698126","https://openalex.org/W2569942321","https://openalex.org/W2617281177","https://openalex.org/W2774521735","https://openalex.org/W2911556593","https://openalex.org/W2914484629","https://openalex.org/W2924819758","https://openalex.org/W2946166375","https://openalex.org/W2949420631","https://openalex.org/W2963557505","https://openalex.org/W2963821675","https://openalex.org/W3004466950","https://openalex.org/W3011280253","https://openalex.org/W3015517257","https://openalex.org/W3030774092","https://openalex.org/W3037209702","https://openalex.org/W3098011928","https://openalex.org/W3101316441","https://openalex.org/W4214935068","https://openalex.org/W4221056862","https://openalex.org/W4229740922","https://openalex.org/W4229802563","https://openalex.org/W4281673115","https://openalex.org/W4281675035","https://openalex.org/W4376639546","https://openalex.org/W4378942626","https://openalex.org/W4385474335","https://openalex.org/W4389615669","https://openalex.org/W4390098115","https://openalex.org/W4390098130","https://openalex.org/W4390098135","https://openalex.org/W4390098297","https://openalex.org/W4390575927","https://openalex.org/W6948011784"],"related_works":["https://openalex.org/W4231397933","https://openalex.org/W2374925474","https://openalex.org/W2041080724","https://openalex.org/W2911818503","https://openalex.org/W2779618893","https://openalex.org/W4380840098","https://openalex.org/W1541890612","https://openalex.org/W2138987445","https://openalex.org/W1738503018","https://openalex.org/W3195481350"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}