Results 1  10
of
485,383
Minimum Steiner Trees in Normed Planes
 DISCRETE & COMPUTATIONAL GEOMETRY
, 1993
"... A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. In this note we investigate various properties of minimum Steiner trees in normed planes, i.e., where the "unit disk" is an arbitrary compact convex centra ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. In this note we investigate various properties of minimum Steiner trees in normed planes, i.e., where the "unit disk" is an arbitrary compact convex
Minimum steiner tree construction
 IN ALPERT, C.J., MEHTA, D.P. AND SAPATNEKAR, S.S. (EDS), THE HANDBOOK OF ALGORITHMS FOR VLSI PHYSICAL DESIGN AUTOMATION
, 2009
"... ..."
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 13 (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
New Approximation Algorithm for Minimum Steiner Tree Problem
"... The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices which are called required. If the edge weights are all positive, then the resulting subgraph is obviously a tree. The computational nature of the problem makes ..."
Abstract
 Add to MetaCart
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices which are called required. If the edge weights are all positive, then the resulting subgraph is obviously a tree. The computational nature of the problem
Delay Bounded Minimum Steiner Tree Algorithms for PerformanceDriven Routing
, 1993
"... this paper, we propose a method of constructing the delay bounded minimum Steiner tree. The motivation behind this is that this kind of tree can be immediately applied on clock routing [17, 16]. Also, in leadingedge IC system design, system/logic design stage specifies the timing requirement of the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this paper, we propose a method of constructing the delay bounded minimum Steiner tree. The motivation behind this is that this kind of tree can be immediately applied on clock routing [17, 16]. Also, in leadingedge IC system design, system/logic design stage specifies the timing requirement
An Iterative Approach for DelayBounded Minimum Steiner Tree Construction
, 1994
"... This paper presents a delaybounded minimum Steiner tree algorithm. The delay bounds, given as inputs to the algorithm, can be different for each individual sourcesink connection. The approach is based on feasible search optimization that satisfies the delay bounds first, then improves the routing t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper presents a delaybounded minimum Steiner tree algorithm. The delay bounds, given as inputs to the algorithm, can be different for each individual sourcesink connection. The approach is based on feasible search optimization that satisfies the delay bounds first, then improves the routing
A faster approximate minimum steiner tree algorithm & primaldual and . . .
, 2009
"... We prove matching upper and lower bounds for the Minimum Steiner Tree (MStT) problem within the adaptive priority stack model introduced by Borodin, Cashman, and Magen [2] and lower bounds within the adaptive priority queue model introduced here. These models, which are extensions of the adaptive pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove matching upper and lower bounds for the Minimum Steiner Tree (MStT) problem within the adaptive priority stack model introduced by Borodin, Cashman, and Magen [2] and lower bounds within the adaptive priority queue model introduced here. These models, which are extensions of the adaptive
An Approximation Algorithm for the Multicast Congestion Problem via Minimum Steiner Trees
 In 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARANCE
, 2002
"... We are given a graph G = (V;E) to represent a communication network where jV j = n and jEj = m and a set of multicast requests S 1 , : : : , S k V . ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We are given a graph G = (V;E) to represent a communication network where jV j = n and jEj = m and a set of multicast requests S 1 , : : : , S k V .
Maintaining Approximate Minimum Steiner Tree and kcenter for Mobile Agents in a Sensor Network
"... Abstract—We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(lg n)approximation to the minimum Steiner tree of the mobile agents such that the maintenance message cost is on average ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract—We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(lg n)approximation to the minimum Steiner tree of the mobile agents such that the maintenance message cost is on average
Packing Steiner trees
"... The Steiner packing problem is to find the maximum number of edgedisjoint subgraphs of a given graph G that connect a given set of required points S. This problem is motivated by practical applications in VLSIlayout and broadcasting, as well as theoretical reasons. In this paper, we study this p ..."
Abstract

Cited by 106 (5 self)
 Add to MetaCart
of terminals is 3. At the end, we consider the fractional version of this problem, and observe that it can be reduced to the minimum Steiner tree problem via the ellipsoid algorithm.
Results 1  10
of
485,383