274 search results - page 13 / 55 » The Polymatroid Steiner Problems |
106
click to vote
COR
2007
15 years 20 days ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
109
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
107
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
103
Voted
DAC
1995
ACM
15 years 4 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
123
click to vote
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...