𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New geometry-inspired relaxations and algorithms for the metric Steiner tree problem

✍ Scribed by Deeparnab Chakrabarty; Nikhil R. Devanur; Vijay V. Vazirani

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
550 KB
Volume
130
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A New Approximation Algorithm for the St
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
✍ Hans JΓΌrgen PrΓΆmel; Angelika Steger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 100 KB

In this paper we present an RNC approximation algorithm for the Steiner tree problem in graphs with performance ratio 5r3 and RNC approximation algorithms for the Steiner tree problem in networks with performance ratio 5r3 q β‘€ for all β‘€ ) 0. This is achieved by considering a related problem, the min

Experimental evaluation of a partitionin
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3
✍ Sivakumar Ravada; Alan T. Sherman πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 614 KB

## Abstract We experimentally evaluate sequential and distributed implementations of an approximation partitioning algorithm by Kalpakis and Sherman for the __Geometric Steiner Minimum Tree Problem (GSMT)__ in __R^d^__ for __d__ = 2,3. Our implementations incorporate an improved method for combinin