{"id":"https://openalex.org/W3172334679","doi":"https://doi.org/10.1145/3406325.3451063","title":"Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces","display_name":"Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3172334679","doi":"https://doi.org/10.1145/3406325.3451063","mag":"3172334679"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT 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/A5111723795","display_name":"Yair Bartal","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yair Bartal","raw_affiliation_strings":["Hebrew University of Jerusalem, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057494907","display_name":"Lee-Ad Gottlieb","orcid":"https://orcid.org/0000-0003-3355-351X"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lee-Ad Gottlieb","raw_affiliation_strings":["Ariel University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8096,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64597885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1028","last_page":"1041"},"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.9987999796867371,"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.9987999796867371,"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.9966999888420105,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9886000156402588,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9201080799102783},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7397633194923401},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.672084391117096},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6304221153259277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5539636611938477},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5529876351356506},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5408738851547241},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.523549497127533},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.48293253779411316},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4802151620388031},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44789913296699524},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40049564838409424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3218788802623749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2794225811958313}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9201080799102783},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7397633194923401},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.672084391117096},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6304221153259277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5539636611938477},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5529876351356506},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5408738851547241},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.523549497127533},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.48293253779411316},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4802151620388031},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44789913296699524},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40049564838409424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3218788802623749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2794225811958313},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1399582570","display_name":null,"funder_award_id":"(1817/17)","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W935408413","https://openalex.org/W1991530421","https://openalex.org/W2011823863","https://openalex.org/W2015908112","https://openalex.org/W2017319551","https://openalex.org/W2020284736","https://openalex.org/W2131648596","https://openalex.org/W2398255676","https://openalex.org/W2774521735","https://openalex.org/W2889530899","https://openalex.org/W2942858066","https://openalex.org/W2950450493","https://openalex.org/W2971624618","https://openalex.org/W3001164300"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,60],"algorithm":[3],"that":[4],"computes":[5],"a":[6,46],"(1+\u0454)-approximate":[7],"Steiner":[8,55],"forest":[9],"in":[10],"near-linear":[11],"time":[12],"n":[13,64],"\u00b7":[14,51],"2(1/\u0454)O(ddim2)":[15],"(loglogn)2,":[16],"where":[17],"ddim":[18],"is":[19],"the":[20,24,30],"doubling":[21],"dimension":[22],"of":[23,48],"metric":[25],"space.":[26],"This":[27],"improves":[28],"upon":[29],"best":[31],"previous":[32],"result":[33],"due":[34],"to":[35],"Chan":[36],"et":[37],"al.":[38],"(SIAM":[39],"J.":[40],"Comput.":[41],"4":[42],"(2018)),":[43],"who":[44],"gave":[45],"runtime":[47,63],"about":[49],"n2O(ddim)":[50],"2(ddim/\u0454)O(ddim)":[52],"\u221alogn.":[53],"For":[54],"tree":[56],"our":[57],"methods":[58],"achieve":[59],"even":[61],"better":[62],"(logn)(1/\u0454)O(ddim2).":[65]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}