Steiner trees in uniformly quasi-bipartite graphs

Information Processing Letters

Volumn 83, Issue 4, 2002, Pages 195-200

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

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Analysis of algorithms; Approximation algorithms; Network design; Steiner tree problem in graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

QUASI-BIPARTITE GRAPHS; STEINER TREES;

DATA PROCESSING;

EID: 0037206192     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00335-0     Document Type: Article

References (19)

1. Proof verification and hardness of approximation problems
2. Improved approximations for the Steiner tree problem
3. The Steiner problem with edge lengths 1 and 2
4. A threshold of lnn for approximating set cover
5. Steiner minimal trees
6. Lower bounds for approximation algorithms for the Steiner tree problem
7. Approximation algorithms for the Steiner tree problem in graphs
8. A 1.598 approximation algorithm for the Steiner problem in graphs
9. Reducibility among combinatorial problems
10. New approximation algorithms for the Steiner tree problems
11. A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
12. On the bidirected cut relaxation for the metric Steiner problem
13. The computation of nearly minimal Steiner trees in graphs
14. Improved Steiner tree approximation in graphs
15. On the approximability of the Steiner tree problem
16. An analysis of the greedy algorithm for the submodular set covering problem
17. An 11/6-approximation algorithm for the network Steiner problem