Sciweavers

Share
121 search results - page 1 / 25
» Strong Lower Bounds for a Survivable Network Design Problem
Sort
View
ENDM
2010
101views more  ENDM 2010»
8 years 5 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
TDSC
2010
157views more  TDSC 2010»
8 years 1 days ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
COCOON
2005
Springer
8 years 11 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
8 years 3 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
books