{"id":"https://openalex.org/W2147258429","doi":"https://doi.org/10.1137/s0895480194266331","title":"Spanning Trees\u2014Short or Small","display_name":"Spanning Trees\u2014Short or Small","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W2147258429","doi":"https://doi.org/10.1137/s0895480194266331","mag":"2147258429"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480194266331","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480194266331","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. Ravi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111640486","display_name":"R. Sundaram","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Sundaram","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066125534","display_name":"Madha V. Marathe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. V. Marathe","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. J. Rosenkrantz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086740853","display_name":"S. S. Ravi","orcid":"https://orcid.org/0000-0002-0893-4364"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. S. Ravi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5087844619"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0352,"has_fulltext":false,"cited_by_count":138,"citation_normalized_percentile":{"value":0.92006076,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"2","first_page":"178","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9958999752998352,"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.7768157720565796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7383902668952942},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6111288070678711},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6014095544815063},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5929960012435913},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5663682222366333},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5039605498313904},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.49950408935546875},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4991614818572998},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4918656349182129},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48972323536872864},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46667349338531494},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4516512453556061},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4384118318557739},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3994242548942566},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3331427574157715},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.13838794827461243},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.13684266805648804},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1279204785823822}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7768157720565796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7383902668952942},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6111288070678711},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6014095544815063},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5929960012435913},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5663682222366333},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5039605498313904},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.49950408935546875},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4991614818572998},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4918656349182129},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48972323536872864},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46667349338531494},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4516512453556061},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4384118318557739},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3994242548942566},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3331427574157715},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.13838794827461243},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.13684266805648804},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1279204785823822},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480194266331","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480194266331","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.703.1725","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.703.1725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.contrib.andrew.cmu.edu/%7Eravi/sidma96.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2016056456","https://openalex.org/W2018876684","https://openalex.org/W2046227217","https://openalex.org/W2064535593","https://openalex.org/W2064733879","https://openalex.org/W2072970829","https://openalex.org/W2143406303"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W2108770488","https://openalex.org/W1587078595","https://openalex.org/W974563791","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W1980288485","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W2081066931"],"abstract_inverted_index":{"We":[0,59,74,134,169],"study":[1],"the":[2,15,32,38,62,71,84,92,97,106,124,131,137],"problem":[3,40,64,138],"of":[4,24,47,94,108,126,139,147,166],"finding":[5,140,148,164,177],"small":[6],"trees.":[7],"Classical":[8],"network":[9],"design":[10],"problems":[11,174],"are":[12,26,102],"considered":[13],"with":[14,78,150],"additional":[16],"constraint":[17],"that":[18,61,146],"only":[19],"a":[20,45,127,160,181],"specified":[21],"number":[22],"k":[23,53],"nodes":[25,54],"required":[27],"to":[28,158,184],"be":[29],"connected":[30],"in":[31,41,55,70,96,130,176],"solution.":[33],"A":[34,153],"prototypical":[35],"example":[36],"is":[37,65,156],"kMST":[39,63],"which":[42,111],"we":[43],"require":[44],"tree":[46],"minimum":[48,151,167],"weight":[49],"spanning":[50],"at":[51],"least":[52],"an":[56],"edge-weighted":[57,86],"graph.":[58],"show":[60],"NP-hard":[66],"even":[67],"for":[68,83,91,105,121,163],"points":[69,95,122],"Euclidean":[72,132],"plane.":[73,98,133],"provide":[75,159],"approximation":[76],"algorithms":[77],"performance":[79],"ratio":[80],"$2\\sqrt{k}":[81],"$":[82],"general":[85],"case":[87,93],"and":[88,116,120,172],"$O(k^{1/4}":[89],")$":[90],"Polynomial-time":[99],"exact":[100],"solutions":[101],"also":[103,135],"presented":[104],"class":[107],"treewidth-bounded":[109],"graphs,":[110,115,119],"includes":[112],"trees,":[113],"series-parallel":[114],"bounded":[117],"bandwidth":[118],"on":[123],"boundary":[125],"convex":[128],"region":[129],"investigate":[136],"short":[141,178],"trees":[142],"and,":[143],"more":[144],"generally,":[145],"networks":[149,179],"diameter.":[152,168],"simple":[154],"technique":[155],"used":[157],"polynomial-time":[161],"solution":[162],"k-trees":[165],"identify":[170],"easy":[171],"hard":[173],"arising":[175],"using":[180],"framework":[182],"due":[183],"T.":[185],"C.":[186],"Hu.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}