DMCA
Improved Steiner Tree Approximation in Graphs (2000)
Cached
Download Links
- [www.cs.virginia.edu]
- [www.cs.gsu.edu]
- [www.cs.virginia.edu]
- [www.cs.virginia.edu]
- DBLP
Other Repositories/Bibliography
by
Gabriel Robins
,
Alexander Zelikovsky
| Citations: | 225 - 6 self |
BibTeX
@MISC{Robins00improvedsteiner,
author = {Gabriel Robins and Alexander Zelikovsky},
title = {Improved Steiner Tree Approximation in Graphs},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best-known approximation algorithm of [10] with performance ratio 1:59.
