✦ LIBER ✦

The bottleneck 2-connected -Steiner network problem for

✍ Scribed by M. Brazil; C.J. Ras; D.A. Thomas

Book ID: 113564772
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 289 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Algorithms for the Bottleneck Stei

Exact Algorithms for the Bottleneck Steiner Tree Problem

✍ Sang Won Bae; Sunghee Choi; Chunseok Lee; Shin-ichi Tanigawa 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 907 KB

Minimax 2-connected subgraphs and the bo

Minimax 2-connected subgraphs and the bottleneck traveling salesman problem

✍ E. A. Timofeev 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 580 KB

Approximation algorithm for bottleneck S

Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

✍ Zi-Mao Li; Da-Ming Zhu; Shao-Han Ma 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 339 KB

On Steiner Versions of (bi)Connectivity

On Steiner Versions of (bi)Connectivity in Network Problems

✍ A. Volgenant; C.W. Duin 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 480 KB

Efficient 2-Approximation Algorithms for

Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks

✍ Hong Shen; Longkun Guo 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 799 KB

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