Dynamic Steiner Tree Problem
نویسندگان
چکیده
منابع مشابه
Dynamic Steiner Tree Problem
This paper proposes a new problem, which we call the Dynamic Steiner Tree Problem. This is related to multipoint connection routing in communications networks, where the set of nodes to be connected changes over time. This problem can be divided into two cases, one in which rearrangement of existing routes is not allowed and a second in which rearrangement is allowed. In the first case, we show...
متن کاملThe full Steiner tree problem
Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V; E) with a length function on E and a proper subset R ⊂ V , the problem is to 4nd a full Steiner tree of minimum length in G, which is a kind of Steiner tree with all the vertices of R as its leaves. In this paper, we show that this problem is NP-c...
متن کاملThe Steiner tree packing problem
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we devel...
متن کاملThe Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کامل8.1 Introduction 18.2 Group Steiner Tree Problem
The group Steiner tree problem was introduced by Reich and Widmayer [1]. It arises in wire routing with multi-port terminals in physical VLSI design. The problem can be stated as follows: given an undirected gragh G = (V,E) with the cost function c : E → R+, and subsets of vertices, which we call groups, g1, g2, ...gk ∈ V . The objective is to find the minimum cost subtree T of G that contains ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1991
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0404033