Sciweavers

134 search results - page 9 / 27
» Light-Trail Networks: Design and Survivability
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
15 years 10 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
QOSIP
2005
Springer
15 years 3 months ago
Topological Design of Survivable IP Networks Using Metaheuristic Approaches
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
Emílio C. G. Wille, Marco Mellia, Emilio Le...
88
Voted
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
15 years 2 months ago
Improved Algorithm for Degree Bounded Survivable Network Design Problem
Anand Louis, Nisheeth K. Vishnoi
HIS
2009
14 years 7 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
CATS
2007
14 years 11 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...