402 search results - page 6 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
ENDM
2010
13 years 7 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
ISAAC
2004
Springer
14 years 21 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
COCOA
2008
Springer
13 years 9 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...
GECCO
2004
Springer
14 years 21 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...