Paper Info
Title
A BDD-Based Heuristic Algorithm for Design of Reliable Networks with Minimal Cost
Abstract
This paper describes a new algorithm based on the Binary Decision Diagrams (BDDs) to solve the reliable communication network design problem (RCND). In this NP-hard problem, a subset of communication links must be chosen such that the network cost is minimized given a network reliability constraint. This problem is closely related to the network reliability computation problem.
Year
DOI
Venue
2006
10.1007/11943952_21
Lecture Notes in Computer Science
Keywords
Field
DocType
binary decision diagram,heuristic algorithm,np hard problem,network design,network reliability
Mobile computing,Mathematical optimization,Telecommunications network,Computer science,Heuristic (computer science),Binary decision diagram,Algorithm,Reliability (computer networking),Wireless ad hoc network,Multi-commodity flow problem,Minimum-cost flow problem,Distributed computing
Conference
Volume
ISSN
Citations 
4325
0302-9743
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Gary Hardy1745.47
Corinne Lucet2998.51
Nikolaos Limnios3836.93