𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Modica–Mortola approximation for the Steiner Problem

✍ Scribed by Lemenant, Antoine; Santambrogio, Filippo

Book ID
125424170
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
216 KB
Volume
352
Category
Article
ISSN
1631-073X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Differential approximation results for t
Differential approximation results for the Steiner tree problem
✍ M Demange; J Monnot; V.Th Paschos 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 654 KB

we study the approximability of three versions of the Steiner tree problem. For the first one where the input graph is only supposed connected, we show that it is not approximable within better than IV \ Nj-' for any E E (0, l), where V and N are the vertex-set of the input graph and the set of term

Approximation algorithm for the group St
Approximation algorithm for the group Steiner network problem
✍ Michal Penn; Stas Rozenfeld 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract In this article we study the __group Steiner network__ problem, which is defined in the following way. Given a graph __G__ = (__V,E__), a partition of its vertices into K groups and connectivity requirements between the different groups, the aim is to find simultaneously a set of repres

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.