Sciweavers

133 search results - page 6 / 27
» Agent-oriented Design for Network Survivability
Sort
View
79
Voted
DISOPT
2008
107views more  DISOPT 2008»
14 years 9 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
ENDM
2010
101views more  ENDM 2010»
14 years 9 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
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
MP
2010
62views more  MP 2010»
14 years 8 months ago
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...