{"id":"https://openalex.org/W2163372049","doi":"https://doi.org/10.1109/tr.2014.2338253","title":"Topology Design with Minimal Cost Subject to Network Reliability Constraint","display_name":"Topology Design with Minimal Cost Subject to Network Reliability Constraint","publication_year":2014,"publication_date":"2014-07-23","ids":{"openalex":"https://openalex.org/W2163372049","doi":"https://doi.org/10.1109/tr.2014.2338253","mag":"2163372049"},"language":"en","primary_location":{"id":"doi:10.1109/tr.2014.2338253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2014.2338253","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/29768/2/227790_227790.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001319391","display_name":"Basima Elshqeirat","orcid":"https://orcid.org/0000-0001-5358-591X"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Basima Elshqeirat","raw_affiliation_strings":["Department of Computing, Curtin University, Perth, Western Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035058895","display_name":"Sieteng Soh","orcid":"https://orcid.org/0000-0001-8974-3158"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sieteng Soh","raw_affiliation_strings":["Department of Computing, Curtin University, Perth, Western Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102126816","display_name":"Suresh Rai","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suresh Rai","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034107686","display_name":"Mihai Lazarescu","orcid":"https://orcid.org/0000-0002-4394-4293"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mihai Lazarescu","raw_affiliation_strings":["Department of Computing, Curtin University, Perth, Western Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.951,"has_fulltext":true,"cited_by_count":46,"citation_normalized_percentile":{"value":0.95587215,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"64","issue":"1","first_page":"118","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10663","display_name":"Advanced Battery Technologies Research","score":0.9742000102996826,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11850","display_name":"Concrete Corrosion and Durability","score":0.9696999788284302,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.7084369659423828},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6669411659240723},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5632660388946533},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5587020516395569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5582467913627625},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5343087911605835},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5066731572151184},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4740143418312073},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44514650106430054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43760403990745544},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.42552340030670166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37616783380508423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3314895033836365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2744033932685852},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2623790204524994},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08225947618484497}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.7084369659423828},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6669411659240723},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5632660388946533},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5587020516395569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5582467913627625},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5343087911605835},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5066731572151184},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4740143418312073},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44514650106430054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43760403990745544},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.42552340030670166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37616783380508423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3314895033836365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2744033932685852},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2623790204524994},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08225947618484497},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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.1109/tr.2014.2338253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2014.2338253","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"},{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/29768","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/29768","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/29768/2/227790_227790.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/29768","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/29768","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/29768/2/227790_227790.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2163372049.pdf","grobid_xml":"https://content.openalex.org/works/W2163372049.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W31749286","https://openalex.org/W1501704428","https://openalex.org/W1965115913","https://openalex.org/W1965800335","https://openalex.org/W1971836998","https://openalex.org/W1986934561","https://openalex.org/W1994996222","https://openalex.org/W2000968838","https://openalex.org/W2011078134","https://openalex.org/W2024108475","https://openalex.org/W2042714316","https://openalex.org/W2052015350","https://openalex.org/W2053071423","https://openalex.org/W2065595640","https://openalex.org/W2068003051","https://openalex.org/W2081177026","https://openalex.org/W2082620437","https://openalex.org/W2088518516","https://openalex.org/W2100976160","https://openalex.org/W2104109499","https://openalex.org/W2110098267","https://openalex.org/W2110979698","https://openalex.org/W2113136889","https://openalex.org/W2119750490","https://openalex.org/W2132118327","https://openalex.org/W2133253967","https://openalex.org/W2135195639","https://openalex.org/W2143474390","https://openalex.org/W2150458954","https://openalex.org/W2153846688","https://openalex.org/W2156293131","https://openalex.org/W2159792079","https://openalex.org/W2168091626","https://openalex.org/W2752885492","https://openalex.org/W4247930157","https://openalex.org/W6679576894"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W3119129187","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851"],"abstract_inverted_index":{"This":[0],"paper":[1,35,80,104],"addresses":[2],"an":[3,93,97],"NP-hard":[4],"problem,":[5,46],"referred":[6],"to":[7,16,21,42,56,60,122,139,170,192,202,230,244],"as":[8],"Network":[9],"Topology":[10],"Design":[11],"with":[12,248],"minimum":[13],"Cost":[14],"subject":[15],"a":[17,23,30,37,49,65,88,157,220,246,249],"Reliability":[18],"constraint":[19],"(NTD-CR),":[20],"design":[22],"minimal-cost":[24],"communication":[25],"network":[26,226],"topology":[27,63,95,247],"that":[28,82,106,167,227],"satisfies":[29],"pre-defined":[31],"reliability":[32,250],"constraint.":[33],"The":[34,79,103],"describes":[36],"dynamic":[38],"programming":[39],"(DP)":[40],"scheme":[41],"solve":[43,57],"the":[44,62,72,107,112,131,136,152,178,182,186,212],"NTD-CR":[45,58],"and":[47,91,117,124,185],"proposes":[48,118],"DP":[50],"approach,":[51],"called":[52],"Dynamic":[53],"Programming":[54],"Algorithm":[55],"(DPCR-ST),":[59],"generate":[61,123,140,203,245],"using":[64,145,181,208],"selected":[66],"sequence":[67],"of":[68,71,100,109,130,180,188,211],"spanning":[69,101,113,128,148,175,213,235,242],"trees":[70,114,129,176,214,243],"network,":[73],"STX":[74,141],"<sub":[75,142],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[76,143,173,233],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">min</sub>":[77,144],".":[78],"shows":[81],"our":[83,189],"DPCR-ST":[84,137,198,237],"approach":[85,138,199,238],"always":[86],"provides":[87],"feasible":[89],"solution,":[90],"produces":[92],"optimal":[94,98,159,205],"given":[96],"order":[99,125],"trees.":[102],"proves":[105],"problem":[108],"optimally":[110],"ordering":[111,183],"is":[115,200],"NP-complete,":[116],"three":[119],"greedy":[120],"heuristics":[121],"only":[126,146,209,240],"k":[127,147],"network.":[132],"Each":[133],"heuristic":[134],"allows":[135],"trees,":[149,236],"which":[150],"improves":[151],"time":[153],"complexity":[154],"while":[155,207],"producing":[156],"near":[158],"topology.":[160],"Simulations":[161],"based":[162],"on":[163],"fully":[164],"connected":[165],"networks":[166],"contain":[168],"up":[169,229],"2.3\u00d710":[171],"<sup":[172,232],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">9</sup>":[174],"show":[177],"merits":[179],"methods":[184],"effectiveness":[187],"algorithm":[190],"vis-\u00e0-vis":[191],"four":[193],"existing":[194],"state-of-the-art":[195],"techniques.":[196],"Our":[197],"able":[201],"81.5%":[204],"results,":[206],"0.77%":[210],"contained":[215],"in":[216],"networks.":[217],"Further,":[218],"for":[219],"typical":[221],"2":[222],"\u00d7":[223],"100":[224],"grid":[225],"contains":[228],"1.899":[231],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">102</sup>":[234],"requires":[239],"k=1214":[241],"no":[251],"larger":[252],"than":[253],"5.05%":[254],"off":[255],"from":[256],"optimal.":[257]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}