Bottleneck Steiner tree with bounded number of Steiner vertices
نویسندگان
چکیده
منابع مشابه
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices
Given a complete graph G = (V,E), where each vertex is labeled either terminal or Steiner, a distance function d : E → R, and a positive integer k, we study the problem of finding a Steiner tree T spanning all terminals and at most k Steiner vertices, such that the length of the longest edge is minimized. We first show that this problem is NP-hard and cannot be approximated within a factor 2− ε...
متن کاملSteiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length
In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STPMSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wirel...
متن کاملTerminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to find a Steiner tree T such that any point in P is a leaf in T and the length of each edge in T is no more than a constant b. The objective of the problem is to minimize the number of Steiner points in T . This problem is mot...
متن کاملParameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of approximation and also parametrization. In particular, on one hand Steiner Tree is known to be APX-hard, and W[2]-hard on the other, if parameterized by the number of non-terminals (St...
متن کاملImproved Steiner Tree Algorithms for Bounded Treewidth
We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in O(B tw+2 · tw · |V |) time, where tw is the graph’s treewidth and the Bell number Bk is the number of partitions of a k-element set. This is a linear time algorithm for graphs with fixed treewidth and a polynomial algorithm for tw = O(log |V |/ log log |V |). While being faster than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2014.12.004