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