scientific article; zbMATH DE number 2044939

MaRDI QIDQ4448761zbMATH OpenFDO

Authors Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040217.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1834686
• Tighter Bounds for Graph Steiner Tree Approximation
• A lower bound for the steiner tree problem in directed graphs
• Approximations and lower bounds for the length of minimal Euclidean Steiner trees
• On approximation algorithms for the terminal Steiner tree problem
• New approximation algorithms for the Steiner tree problems
• Lower bounds for rectilinear Steiner trees in bounded space
• Approximation algorithms for the terminal Steiner tree problem
• scientific article; zbMATH DE number 139910

Cited in

(11)

• Steiner trees in uniformly quasi-bipartite graphs.
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
• Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
• Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
• Approaches to the Steiner Problem in Networks
• Strong Steiner tree approximations in practice
• scientific article; zbMATH DE number 1834686 (Why is no real title available?)
• scientific article; zbMATH DE number 1424548 (Why is no real title available?)
• A partition-based relaxation for Steiner trees
• Lower bounds for the relative greedy algorithm for approximating Steiner trees
• scientific article; zbMATH DE number 5042868 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448761)