{"id":"https://openalex.org/W2076821032","doi":"https://doi.org/10.1137/0213022","title":"Constrained Optimum Communication Trees and Sensitivity Analysis","display_name":"Constrained Optimum Communication Trees and Sensitivity Analysis","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W2076821032","doi":"https://doi.org/10.1137/0213022","mag":"2076821032"},"language":"en","primary_location":{"id":"doi:10.1137/0213022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213022","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/A5100905024","display_name":"Sunita Agarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I3056136","display_name":"Motilal Nehru Medical College","ror":"https://ror.org/03jmdp146","country_code":"IN","type":"education","lineage":["https://openalex.org/I3056136"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sunita Agarwal","raw_affiliation_strings":["Moti Lal Nehru Regional Engineering College, Allahabad, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Moti Lal Nehru Regional Engineering College, Allahabad, India#TAB#","institution_ids":["https://openalex.org/I3056136"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087837314","display_name":"Atul K. Mittal","orcid":"https://orcid.org/0000-0003-4647-2559"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. K. Mittal","raw_affiliation_strings":["Indian Institute of Technology , Kanpur , India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology , Kanpur , India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032097203","display_name":"Praveen Sharma","orcid":"https://orcid.org/0000-0002-4096-140X"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Sharma","raw_affiliation_strings":["Indian Institute of Technology , Kanpur , India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology , Kanpur , India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100905024"],"corresponding_institution_ids":["https://openalex.org/I3056136"],"apc_list":null,"apc_paid":null,"fwci":1.0552,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76802255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"2","first_page":"315","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"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.9962999820709229,"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/T11476","display_name":"Graph theory and applications","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9753000140190125,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6944180130958557},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6872867345809937},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5949093699455261},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5162120461463928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4965558648109436},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4895128011703491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4640326499938965},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.463703453540802},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.44825100898742676},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4369819462299347},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4296438992023468},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.4233786463737488},{"id":"https://openalex.org/keywords/communications-system","display_name":"Communications system","score":0.415077805519104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38483336567878723},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38096946477890015},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2427637279033661},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12938115000724792}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6944180130958557},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6872867345809937},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5949093699455261},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5162120461463928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4965558648109436},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4895128011703491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4640326499938965},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.463703453540802},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.44825100898742676},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4369819462299347},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4296438992023468},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.4233786463737488},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.415077805519104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38483336567878723},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38096946477890015},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2427637279033661},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12938115000724792},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213022","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2064535593","https://openalex.org/W2115049345","https://openalex.org/W2129260487"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"Consider":[0],"n":[1,27],"cities":[2,43,88,110,138],"with":[3,55],"specified":[4,87],"communication":[5,14,35,49,66,82,98,116,128,132,154,164],"requirements":[6],"between":[7,50,74,134],"all":[8,21,169],"pairs":[9,41,108],"of":[10,31,34,42,48,53,64,71,96,109,125,137,152,170],"cities.":[11,77],"An":[12],"optimum":[13,81,127,163],"tree":[15,129],"has":[16],"the":[17,22,26,29,37,62,65,69,72,75,93,97,115,123,131,147,153],"property":[18],"that":[19,106,145],"among":[20],"spanning":[23,59],"trees":[24,83,165],"connecting":[25],"cities,":[28],"sum":[30],"its":[32],"costs":[33],"for":[36,146],"$n(n":[38],"-":[39,161],"1)/2$":[40],"is":[44,61,104,139],"minimum.":[45],"The":[46],"cost":[47],"a":[51,58,135],"pair":[52,136],"nodes,":[54],"respect":[56],"to":[57,91,141],"tree,":[60,99],"product":[63],"requirement":[67,133],"and":[68,100,166],"length":[70],"path":[73],"two":[76],"We":[78,118,143],"construct":[79,168],"constrained":[80],"when":[84,101,130],"(i)":[85],"certain":[86,107],"are":[89],"required":[90,105],"be":[92,111],"outer":[94],"nodes":[95],"(ii)":[102],"it":[103],"connected":[112],"directly":[113],"in":[114,122,172],"tree.":[117],"further":[119],"analyse":[120],"changes":[121],"structure":[124],"an":[126],"subject":[140],"changes.":[142],"show":[144],"whole":[148],"range":[149],"$[0,\\infty":[150],")$,":[151],"requirement,":[155],"there":[156],"exist":[157],"at":[158],"most":[159],"$(n":[160],"1)$":[162],"we":[167],"them":[171],"$O(n^4":[173],")$":[174],"computational":[175],"effort.":[176]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}