Results 1  10
of
140
A Superstabilizing log(n)Approximation Algorithm for Dynamic Steiner Trees
, 902
"... In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimumweight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group). Steiner trees are good candidates to efficiently ..."
Abstract
 Add to MetaCart
In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimumweight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group). Steiner trees are good candidates
Dynamic programming for minimum Steiner trees
 Theory Comput Syst
, 2006
"... We present a new dynamic programming algorithm that solves the minimum Steiner tree problem on graphs with k terminals in time O ∗ (c k) for any c> 2. This improves the running time of the previously fastest parameterized algorithm by Dreyfus–Wagner [2] of order O ∗ (3 k) and the socalled “full ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We present a new dynamic programming algorithm that solves the minimum Steiner tree problem on graphs with k terminals in time O ∗ (c k) for any c> 2. This improves the running time of the previously fastest parameterized algorithm by Dreyfus–Wagner [2] of order O ∗ (3 k) and the socalled “full
Packing Steiner trees: separation algorithms
 ZIB
, 1993
"... In this paper we investigate separation problems for classes of inequalities valid for the polytope associated with the Steiner tree packing problem, a problem that arises, e. g., in VLSI routing. The separation problem for Steiner partition inequalities is NPhard in general. We show that it can be ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper we investigate separation problems for classes of inequalities valid for the polytope associated with the Steiner tree packing problem, a problem that arises, e. g., in VLSI routing. The separation problem for Steiner partition inequalities is NPhard in general. We show that it can
Dynamic Steiner Tree and Subgraph TSP
"... In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an nvertex graph G = (V,E,w) with positive real edge weights, and our goal is to maintain a tree inG which is a good approximation of the minimum Steiner tree spanning a termina ..."
Abstract
 Add to MetaCart
In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an nvertex graph G = (V,E,w) with positive real edge weights, and our goal is to maintain a tree inG which is a good approximation of the minimum Steiner tree spanning a
Rectilinear Full Steiner Tree Generation
 NETWORKS
, 1997
"... The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic p ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic
Spanning Trees in Hypergraphs with Applications to Steiner Trees
, 1998
"... This dissertation examines the geometric Steiner tree problem: given a set of terminals in the plane, find a minimumlength interconnection of those terminals according to some geometric distance metric. In the process, however, it addresses a much more general and widely applicable problem, that of ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
, that of finding a minimumweight spanning tree in a hypergraph. The geometric Steiner tree problem is known to be NPcomplete for the rectilinear metric, and NPhard for the Euclidean metric. The fastest exact algorithms (in practice) for these problems use two phases: First a small but sufficient set of full
Buffered Steiner Tree Construction with Wire Sizing for Interconnect Layout Optimization
, 1996
"... This paper presents an e cient algorithm for buffered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a Steiner tree with buffer insertion and wire sizing so that t ..."
Abstract

Cited by 70 (16 self)
 Add to MetaCart
This paper presents an e cient algorithm for buffered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a Steiner tree with buffer insertion and wire sizing so
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees
 In Proceedings of the Fourth Great Lakes Symposium on VLSI
, 1994
"... An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.TI 1 ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.TI 1
Online Priority Steiner Tree Problems
, 2009
"... A central issue in the design of modern communication networks is the provision of QualityofService (QoS) guarantees at the presence of heterogeneous users. For instance, in QoS multicasting, a source needs to efficiently transmit a message to a set of receivers, each requiring support at a diff ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
different QoS level (e.g., bandwidth). This can be formulated as the Priority Steiner tree problem: Here, each link of the underlying network is associated with a priority value (namely the QoS level it can support) as well as a cost value. The objective is to find a tree of minimum cost that spans all
SBMT–STEINER BACKUP MULTICAST TREE
"... In the backbone network, a Steiner multicast tree (SMT) will be established for multicast members to minimize the traffic load on networks. However, a communication link or node may fail due to some accidental factors during the transmission period. Downstream nodes with respect to the failed link/n ..."
Abstract
 Add to MetaCart
/node will be forced to leave this tree. In order to guarantee the quality of service (QoS), it is desirable to have some schemes for the multicast tree so that such termination of service can be avoided or at least, reduced. In this paper, we propose a fixed SMT algorithm (FSA) to construct the Steiner backup
Results 1  10
of
140