Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

NETWORKS
2006

favoriteEmaildiscussreport

111views Computer Networks» more NETWORKS 2006»

Lower bounds for the relative greedy algorithm for approximating Steiner trees

13 years 4 months ago

Lower bounds for the relative greedy algorithm for approximating Steiner trees

Download www.matheon.de

Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a polynomial time 2-approximation algorithm exists. In 1996 Zelikovsky [11] suggested an approximation algorithm for the Steiner tree problem that is called the relative greedy algorithm. Till today the performance ratio of this

Stefan Hougardy, Stefan Kirchner

Real-time Traffic

Computer Networks | NETWORKS 2006 | Relative Greedy Algorithm | Shortest Subgraph | Steiner Tree Problem |

claim paper

Related Content

» Terminal Steiner Tree with Bounded Edge Length

» Analysis of greedy approximations with nonsubmodular potential functions

» Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

» Stochastic analyses for online combinatorial optimization problems

» Integrality ratio for group Steiner trees and directed steiner trees

» A NearTight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

» An Improved LPbased Approximation for Steiner Tree

» Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	NETWORKS
Authors	Stefan Hougardy, Stefan Kirchner

Comments (0)