Open AccessBook
Design of Survivable Networks
Reads0
Chats0
TLDR
In this paper, a survey of survivability models using node types is presented, including basic inequalities, lifting theorems, partition inequalities, and node partition inequalities for survivability under connectivity constraints.Abstract:
Motivation.- Network survivability models using node types.- Survivable network design under connectivity constraints - a survey.- Decomposition.- Basic inequalities.- Lifting theorems.- Partition inequalities.- Node partition inequalities.- Lifted r-cover inequalities.- Comb inequalities.- How to find valid inequalities.- Implementation of the cutting plane algorithm.- Computational results.read more
Citations
More filters
Proceedings ArticleDOI
Fast discovery of connection subgraphs
TL;DR: This work defines a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes, and presents a formal definition of this problem, and an ideal solution based on electricity analogues.
Book
The primal-dual method for approximation algorithms and its application to network design problems
TL;DR: The primal-dual method was proposed by Dantzig, Ford, and Fulkerson [DFF56] as another means of solving linear programs, and Ironically, their inspiration came from combinatorial optimization.
Journal ArticleDOI
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
TL;DR: A new algorithm is presented which creates redundant trees on arbitrary node- redundant or link-redundant networks such that any node is connected to the common root of the trees by at least one of the Trees in case of node or link failure.
Proceedings ArticleDOI
Center-piece subgraphs: problem definition and fast solutions
Hanghang Tong,Christos Faloutsos +1 more
TL;DR: Wall-clock timing results on the DBLP dataset show that the proposed approximation achieve good accuracy for about 6:1 speedup, and experiments confirm that the method naturally deals with multi-source queries and that the resulting subgraphs agree with the intuition.