{"id":"https://openalex.org/W2035941809","doi":"https://doi.org/10.1109/apcc.2013.6766047","title":"Dynamic programming for minimal cost topology with two terminal reliability constraint","display_name":"Dynamic programming for minimal cost topology with two terminal reliability constraint","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2035941809","doi":"https://doi.org/10.1109/apcc.2013.6766047","mag":"2035941809"},"language":"en","primary_location":{"id":"doi:10.1109/apcc.2013.6766047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcc.2013.6766047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 19th Asia-Pacific Conference on Communications (APCC)","raw_type":"proceedings-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/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","Dept. of Comput., Curtin Univ., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ., Perth, WA, 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","Dept. of Comput., Curtin Univ., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ., Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","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","Dept. of Comput., Curtin Univ., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University, Perth, Western Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ., Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","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","Dept. of Electr. & Comput. Eng., Louisiana State Univ., 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"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7795,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86789555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":null,"first_page":"740","last_page":"745"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.977400004863739,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11941","display_name":"Power System Reliability and Maintenance","score":0.9674999713897705,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7533739805221558},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6641930341720581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6232225894927979},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5936334133148193},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5624764561653137},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5486361980438232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5406903624534607},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5341203808784485},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5198220014572144},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5153117179870605},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47236281633377075},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46464961767196655},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.41918814182281494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31568118929862976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3082711696624756},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15746691823005676},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09066227078437805},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.07119280099868774}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7533739805221558},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6641930341720581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6232225894927979},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5936334133148193},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5624764561653137},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5486361980438232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5406903624534607},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5341203808784485},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5198220014572144},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5153117179870605},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47236281633377075},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46464961767196655},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.41918814182281494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31568118929862976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3082711696624756},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15746691823005676},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09066227078437805},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.07119280099868774},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/apcc.2013.6766047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcc.2013.6766047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 19th Asia-Pacific Conference on Communications (APCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W31749286","https://openalex.org/W1965800335","https://openalex.org/W2052120747","https://openalex.org/W2052438810","https://openalex.org/W2119750490","https://openalex.org/W2120236894","https://openalex.org/W2136190542","https://openalex.org/W2143474390","https://openalex.org/W2156293131","https://openalex.org/W4250574621","https://openalex.org/W6677712457","https://openalex.org/W6680128826"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187","https://openalex.org/W3209920515"],"abstract_inverted_index":{"This":[0,49],"paper":[1,50],"addresses":[2],"an":[3],"NP-complete":[4],"problem,":[5],"called":[6,64],"NTD-CR,":[7],"to":[8,47,57,84,106,147,158],"design":[9],"a":[10,17,52,70],"minimal-cost":[11],"communication":[12],"network":[13,46],"topology":[14,68],"that":[15],"satisfies":[16],"pre-defined":[18],"two":[19,80],"terminal":[20],"reliability":[21,37,43],"constraint,":[22],"given":[23],"the":[24,27,41,45,59,67,76,94,100,108,117,134,139,153,164],"locations":[25],"of":[26,73,75,97,136,141,160],"various":[28,131],"computer":[29],"centers":[30],"(nodes),":[31],"their":[32],"connecting":[33],"links,":[34],"each":[35],"link's":[36],"and":[38,40,86,138],"cost,":[39],"required":[42],"for":[44],"operate.":[48],"formulates":[51],"dynamic":[53],"programming":[54],"(DP)":[55],"scheme":[56],"solve":[58],"NTD-CR":[60],"problem.":[61],"DP":[62],"approach,":[63],"DPCR-P,":[65],"generates":[66],"using":[69,111,127,155],"selected":[71,109],"set":[72],"paths":[74,98,110,162],"network.":[77,101],"We":[78],"propose":[79],"different":[81],"greedy":[82],"heuristics":[83],"generate":[85,148],"order":[87],"only":[88,112,156],"k\u2264n":[89],"paths,":[90,114],"where":[91],"n":[92],"is":[93,145],"total":[95],"number":[96],"in":[99,163],"Each":[102],"heuristic":[103],"allows":[104],"DPCR-P":[105,144],"enumerate":[107],"k":[113],"which":[115],"improves":[116],"time":[118],"complexity":[119],"while":[120],"producing":[121],"near":[122],"optimal":[123,150],"topology.":[124],"Extensive":[125],"simulations":[126],"benchmark":[128],"networks":[129,154],"with":[130],"sizes":[132],"show":[133],"merits":[135],"path-orders,":[137],"effectiveness":[140],"our":[142],"approach.":[143],"able":[146],"91%":[149],"results":[151,169],"on":[152],"8.89%":[157],"27.5%":[159],"all":[161],"networks.":[165],"Further,":[166],"its":[167],"non-optimal":[168],"are":[170],"no":[171],"more":[172],"than":[173],"10.97%":[174],"off":[175],"from":[176],"optimal.":[177]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}