A Dynamic Programming Algorithm for Reliable Network Design
This paper addresses an NP-hard problem to design a network topology with maximum all-terminal reliability subject to a cost constraint, given the locations of the various computer centers (nodes), their connecting links, each link’s reliability and cost, and the maximum budget cost to install the l...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/14610 |