✦ LIBER ✦

Probabilistic models for the Steiner Tree problem

✍ Scribed by Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 216 KB
Volume: 56
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20346

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic partitioning algorithms fo

Probabilistic partitioning algorithms for the rectilinear steiner problem

✍ János Komlós; M. T. Shing 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

A tabu search heuristic for the Steiner

A tabu search heuristic for the Steiner Tree Problem

✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

The Steiner Tree Problem in Orientation

The Steiner Tree Problem in Orientation Metrics

✍ G.Y. Yan; A. Albrecht; G.H.F. Young; C.K. Wong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Given a set 3 of : i (i=1, 2, ..., k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Specifically,

A Polylogarithmic Approximation Algorith

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

✍ Naveen Garg; Goran Konjevod; R. Ravi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a

Variations of the prize-collecting Stein

Variations of the prize-collecting Steiner tree problem

✍ Olena Chapovska; Abraham P. Punnen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract The prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in __O__(__m_

A strong lower bound for the Node Weight

A strong lower bound for the Node Weighted Steiner Tree Problem

✍ Engevall, Stefan; G�the-Lundgren, Maud; V�rbrand, Peter 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex weights are considered. Given an undirected graph, the problem is to find a tree that spans a subset of the vertices and is such that the total