Steiner trees in uniformly quasi-bipartite graphs

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation

• Type: Journal
• Year: 2002
• Where: IPL
• Authors: Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
• Keywords: Approximation Algorithms, Continuous Progress, IPL 2002, Steiner Tree Problem