scientific article; zbMATH DE number 2044939
From MaRDI portal
Publication:4448761
zbMath1042.68635MaRDI QIDQ4448761
Stefan Hougardy, Clemens Gröpl, Hans Jürgen Prömel, Till Nierhoff
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040217.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Strong Steiner Tree Approximations in Practice, Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees, Approaches to the Steiner Problem in Networks, Steiner trees in uniformly quasi-bipartite graphs.
