On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem

2012 ◽  
pp. 225-236
Author(s):  
Mario Ruthmair ◽  
Günther R. Raidl
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Constrained Steiner Tree ◽  
Delay Variation

A Lagrangean-based decomposition approach for the link constrained Steiner tree problem

2017 ◽  
Vol 33 (3) ◽  
pp. 650-670 ◽  
Author(s):  
Luigi Di Puglia Pugliese ◽  
Manlio Gaudioso ◽  
Francesca Guerriero ◽  
Giovanna Miglionico
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Decomposition Approach ◽  
Constrained Steiner Tree

DIAMETER-CONSTRAINED STEINER TREES

2011 ◽  
Vol 03 (04) ◽  
pp. 491-502 ◽  
Author(s):  
WEI DING ◽  
GUOHUI LIN ◽  
GUOLIANG XUE
Keyword(s):  
Steiner Tree ◽  
Approximation Scheme ◽  
Undirected Graph ◽  
Minimum Cost ◽  
Steiner Tree Problem ◽  
Polynomial Time Approximation Scheme ◽  
Maximum Weight ◽  
Tree Diameter ◽  
Fixed Topology ◽  
Constrained Steiner Tree

Given an edge-weighted undirected graph G = (V, E, c, w), where each edge e ∈ E has a non-negative cost c(e) and a non-negative weight w(e), a set S ⊆ V of terminals and a positive constant D0, we seek a minimum cost Steiner tree in which all terminals appear as leaves and the tree diameter is bounded by D0. Here the tree diameter is the maximum weight of the paths connecting two different leaves in the tree. Such a problem is called the minimum cost diameter-constrained Steiner tree problem. The problem is NP-hard even when the topology of the Steiner tree is fixed. In present paper we focus on this fixed topology restricted version and present a fully polynomial time approximation scheme for computing a minimum cost diameter-constrained Steiner tree.

A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem

2010 ◽  
Vol 38 (1) ◽  
pp. 57-62 ◽  
Author(s):  
Marcelo Santos ◽  
Lúcia M.A. Drummond ◽  
Eduardo Uchoa
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Dual Ascent ◽  
Constrained Steiner Tree

A constrained Steiner tree problem

1995 ◽  
Vol 81 (2) ◽  
pp. 430-439 ◽  
Author(s):  
Moshe B. Rosenwein ◽  
Richard T. Wong
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Constrained Steiner Tree
Sign in / Sign up

Export Citation Format

Share Document