✦ LIBER ✦

New Reduction Techniques for the Group Steiner Tree Problem

✍ Scribed by Ferreira, Carlos Eduardo; de Oliveira Filho, Fernando M.

Book ID: 118204052
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 179 KB
Volume: 17
Category: Article
ISSN: 1052-6234
DOI: 10.1137/040610891

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reductions for the rectilinear steiner t

Reductions for the rectilinear steiner tree problem

✍ Pawel Winter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 842 KB

New algorithms for the rectilinear Stein

New algorithms for the rectilinear Steiner tree problem

✍ Ho, J.-M.; Vijayan, G.; Wong, C.K. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 1000 KB

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

Two new criteria for finding Steiner hul

Two new criteria for finding Steiner hulls in Steiner tree problems

✍ J. Scott Provan 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 815 KB

Probabilistic models for the Steiner Tre

Probabilistic models for the Steiner Tree problem

✍ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

Two Heuristics for the Euclidean Steiner

Two Heuristics for the Euclidean Steiner Tree Problem

✍ Derek R. Dreyer; Michael L. Overton 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 368 KB