701 search results - page 1 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
108
Voted
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known
154
Voted
COCOA
2009
Springer
15 years 10 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...
147
Voted
ICALP
2009
Springer
16 years 4 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...
158
click to vote
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
144
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...