Lower bounds for the relative greedy algorithm for approximating Steiner trees

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

• Type: Journal
• Year: 2006
• Where: NETWORKS
• Authors: Stefan Hougardy, Stefan Kirchner
• Keywords: Computer Networks, NETWORKS 2006, Relative Greedy Algorithm, Shortest Subgraph, Steiner Tree Problem