274 search results - page 23 / 55 » The Polymatroid Steiner Problems |
132
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
94
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
87
Voted
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
99
Voted
IPCO
2010
15 years 2 months ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
97
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...