118 search results - page 1 / 24 » Strong Lower Bounds for a Survivable Network Design Problem |
ENDM
2010
13 years 4 months ago
2010
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...
TDSC
2010
12 years 11 months ago
2010
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...
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
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 ...
SAGT
2010
Springer
13 years 2 months ago
2010
Springer
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....