New approximation algorithm for minimum Steiner tree problem
From MaRDI portal
Recommendations
Cited in
(16)- Approximating the weight of shallow Steiner trees
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
- New approximation algorithms for the Steiner tree problems
- A PTAS for weight constrained Steiner trees in series--parallel graphs.
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
- scientific article; zbMATH DE number 3985248 (Why is no real title available?)
- scientific article; zbMATH DE number 139910 (Why is no real title available?)
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- Definition and algorithms for reliable Steiner tree problem
- Tighter Bounds for Graph Steiner Tree Approximation
- Lower bounds for the relative greedy algorithm for approximating Steiner trees
- APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST
- New primal-dual algorithms for Steiner tree problems
- The Steiner tree problem on graphs: inapproximability results
This page was built for publication: New approximation algorithm for minimum Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905980)
