25 search results - page 1 / 5 » Approximating the Weight of Shallow Steiner Trees |
92
Voted
DAM
1999
14 years 10 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
103
click to vote
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
75
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
CIAC
2006
Springer
15 years 1 months ago
2006
Springer