The complexity of approximating the class Steiner tree problem
From MaRDI portal
Recommendations
Cited in
(9)- Class Steiner trees and VLSI-design
- The rectilinear class Steiner tree problem for intervals on two parallel lines
- Revising Johnson's table for the 21st century
- Some formulations for the group Steiner tree problem
- Steiner trees for hereditary graph classes: a treewidth perspective
- Complexity of minimum corridor guarding problems
- scientific article; zbMATH DE number 5042868 (Why is no real title available?)
- scientific article; zbMATH DE number 2230214 (Why is no real title available?)
- An approximation algorithm for generalized connectivity problem on planar graphs
This page was built for publication: The complexity of approximating the class Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694721)