141 search results - page 1 / 29 » Approximating Steiner trees in graphs with restricted weight... |
71
Voted
NETWORKS
1998
14 years 10 months ago
1998
107
click to vote
COCOA
2009
Springer
15 years 5 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...
107
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
ICALP
2009
Springer
15 years 11 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...
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...