Results 11  20
of
19,226
Creating and Exploiting Flexibility in Steiner Trees
 IN PROC. ACM/IEEE DESIGN AUTOMATION CONFERENCE
, 2001
"... This paper presents the concept of flexibility  a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net wi ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
This paper presents the concept of flexibility  a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net
Packing Steiner Trees
"... Let T be a distinguished subset of vertices in a graph G. A TSteiner tree is a subgraph of G that is a tree and that spans T. Kriesell conjectured that G contains k pairwise edgedisjoint TSteiner trees provided that every edgecut of G that separates T has size ≥ 2k. When T = V (G) a TSteiner t ..."
Abstract
 Add to MetaCart
Let T be a distinguished subset of vertices in a graph G. A TSteiner tree is a subgraph of G that is a tree and that spans T. Kriesell conjectured that G contains k pairwise edgedisjoint TSteiner trees provided that every edgecut of G that separates T has size ≥ 2k. When T = V (G) a TSteiner
The Steiner tree polytope and related polyhedra
, 1994
"... We consider the vertexweighted version of the undirected Steiner tree problem. In this problem, a cost is incurred both for the vertices and the edges present in the Steiner tree. We completely describe the associated polytope by linear inequalities when the underlying graph is seriesparallel. For ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
We consider the vertexweighted version of the undirected Steiner tree problem. In this problem, a cost is incurred both for the vertices and the edges present in the Steiner tree. We completely describe the associated polytope by linear inequalities when the underlying graph is series
Creating and Exploiting Flexibility in Steiner Trees
 In Proc. ACM/IEEE Design Automation Conference
, 2001
"... This paper presents the concept of flexibility  a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net wi ..."
Abstract
 Add to MetaCart
This paper presents the concept of flexibility  a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net
On MinPower Steiner Tree⋆
"... an edgeweighted undirected graph and a set of terminal nodes. The goal is to compute a mincost tree S which spans all terminals. In this paper we consider the minpower version of the problem (a.k.a. symmetric multicast), which is better suited for wireless applications. Here, the goal is to mini ..."
Abstract
 Add to MetaCart
as to support protocols with ack messages). Observe that we do not require that edge costs reflect Euclidean distances between nodes: this way we can model obstacles, limited transmitting power, nonomnidirectional antennas etc. Differently from its mincost counterpart, minpower Steiner tree is NPhard even
On Directed Steiner Trees
 In 13th Annual ACMSIAM Symposium on Discrete Algorithms
, 2002
"... The directed Steiner tree problem is the following: given a directed graph G = (V; E) with weights on the edges, a set of terminals S ` V , and a root vertex r, find a minimum weight outbranching T rooted at r, such that all vertices in S are included in T . This problem is known to be NPhard. Rece ..."
Abstract
 Add to MetaCart
The directed Steiner tree problem is the following: given a directed graph G = (V; E) with weights on the edges, a set of terminals S ` V , and a root vertex r, find a minimum weight outbranching T rooted at r, such that all vertices in S are included in T . This problem is known to be NPhard
Local Improvement in Steiner Trees
 PROC. OF THE 3RD GREAT LAKES SYMP. ON VLSI
, 1993
"... Next to the traveling salesman problem, the Steiner problem is possibly the most mentioned NPcomplete problem in existence. This is due to the ease with which it can be stated (join a set of points with the smallest collection of connections) and its many, varied applications. For example, with a ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
, with a rectilinear metric, Steiner spanning trees are used in several phases of CAD for VLSI systems. Since this problem is NPcomplete [GJ77], most attempts at solving it have been heuristics based on paradigms such as minimal spanning tree modification, computational geometry, stochastic evolution
Hardness and approximation of octilinear Steiner trees
 IN PROCEEDINGS OF THE 16TH INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC 2005
, 2005
"... Given a point set K of terminals in the plane, the octilinear Steiner tree problem is to find a shortest tree that interconnects all terminals and edges run either in horizontal, vertical, or ±45 ◦ diagonal direction. This problem is fundamental for the novel octilinear routing paradigm in VLSI de ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a point set K of terminals in the plane, the octilinear Steiner tree problem is to find a shortest tree that interconnects all terminals and edges run either in horizontal, vertical, or ±45 ◦ diagonal direction. This problem is fundamental for the novel octilinear routing paradigm in VLSI
The Prize Collecting Steiner Tree Problem
 In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms
, 1998
"... This work is motivated by an application in local access network design that can be modeled using the NPhard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primaldual 2approximation algorithm devised for it by Goemans and Williamson. We develop seve ..."
Abstract

Cited by 103 (1 self)
 Add to MetaCart
This work is motivated by an application in local access network design that can be modeled using the NPhard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primaldual 2approximation algorithm devised for it by Goemans and Williamson. We develop
Steiner Tree NPcompleteness Proof
, 2003
"... This document is an exercise for the Computational Complexity course taken at the University of Trento. We propose an NPcompleteness proof for the Steiner Tree problem in graphs. ..."
Abstract
 Add to MetaCart
This document is an exercise for the Computational Complexity course taken at the University of Trento. We propose an NPcompleteness proof for the Steiner Tree problem in graphs.
Results 11  20
of
19,226