{"id":"https://openalex.org/W1985209733","doi":"https://doi.org/10.1137/060666202","title":"Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs","display_name":"Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs","publication_year":2008,"publication_date":"2008-12-22","ids":{"openalex":"https://openalex.org/W1985209733","doi":"https://doi.org/10.1137/060666202","mag":"1985209733"},"language":"en","primary_location":{"id":"doi:10.1137/060666202","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060666202","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["yuval.emek@weizmann.ac.il and david.peleg@weizmann.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"yuval.emek@weizmann.ac.il and david.peleg@weizmann.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000264005"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.483,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.8854128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"5","first_page":"1761","last_page":"1781"},"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.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8347381353378296},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7525988221168518},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7517522573471069},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6595801115036011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6005007028579712},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5657795667648315},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5545608997344971},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.5420137643814087},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5404006838798523},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5238849520683289},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5013201236724854},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4801701605319977},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4774363934993744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.416428804397583},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2775234580039978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2328161895275116},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1985880434513092},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.060126036405563354}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8347381353378296},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7525988221168518},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7517522573471069},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6595801115036011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6005007028579712},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5657795667648315},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5545608997344971},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.5420137643814087},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5404006838798523},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5238849520683289},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5013201236724854},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4801701605319977},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4774363934993744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.416428804397583},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2775234580039978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2328161895275116},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1985880434513092},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.060126036405563354},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060666202","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060666202","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.8942","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.8942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~yuvale/Publications/approximating_unweighted_MMST.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.222.3187","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.3187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distcomp.ethz.ch/lectures/fs10/seminar/paper/jasmin-3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1973029334","https://openalex.org/W1980453887","https://openalex.org/W1981859328","https://openalex.org/W2002041206","https://openalex.org/W2015077309","https://openalex.org/W2018963243","https://openalex.org/W2063722406","https://openalex.org/W2169528473","https://openalex.org/W2912257407","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2058332489","https://openalex.org/W1997570556","https://openalex.org/W2943635264","https://openalex.org/W2095481180","https://openalex.org/W4287325277","https://openalex.org/W4239736023","https://openalex.org/W1576317141","https://openalex.org/W2074417667","https://openalex.org/W2408068853","https://openalex.org/W3132067041"],"abstract_inverted_index":{"Given":[0],"a":[1,5,16,44],"graph":[2],"\\(G\\)":[3,20],"and":[4,76],"spanning":[6,56],"tree":[7,17,45],"\\(T\\)":[8,14,30],"of":[9,19,27,42],"\\(G\\),":[10],"we":[11],"say":[12],"that":[13,90],"is":[15,31,49,71,88],"\\(t\\)-spanner":[18,46],"if":[21],"the":[22,53,63,77,93],"distance":[23,37],"between":[24],"every":[25],"pair":[26],"vertices":[28],"in":[29,38],"at":[32],"most":[33],"\\(t\\)":[34,48],"times":[35],"their":[36],"\\(G\\).":[39],"The":[40,69],"problem":[41,65,70,94],"finding":[43],"minimizing":[47],"referred":[50],"to":[51,73],"as":[52],"Minimum":[54],"Max-Stretch":[55],"Tree":[57],"(MMST)":[58],"problem.":[59],"This":[60],"paper":[61,78],"concerns":[62],"MMST":[64],"on":[66],"unweighted":[67],"graphs.":[68],"known":[72],"be":[74,96],"NP-hard,":[75],"presents":[79],"an":[80],"\\(O(\\log":[81],"n)\\)-approximation":[82],"algorithm":[83],"for":[84],"it.":[85],"Furthermore,":[86],"it":[87],"established":[89],"unless":[91],"\\(\\mathrm{P}=\\mathrm{NP}\\),":[92],"cannot":[95],"approximated":[97],"additively":[98],"by":[99],"any":[100],"\\(o(n)\\)":[101],"term.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}