On reductions for the Steiner problem in graphs
From MaRDI portal
Publication:876697
Recommendations
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1424551 (Why is no real title available?)
- An algorithm for the steiner problem in graphs
- Network decomposition for the optimization of connection structures
- On theories with a combinatorial definition of 'equivalence'
- Reduction tests for the steiner problem in grapsh
- The Steiner tree problem
Cited in
(9)- scientific article; zbMATH DE number 4139520 (Why is no real title available?)
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- Reductions for the rectilinear steiner tree problem
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Reduction tests for the steiner problem in grapsh
- scientific article; zbMATH DE number 1947441 (Why is no real title available?)
- An edge elimination test for the Steiner problem in graphs
- scientific article; zbMATH DE number 3932820 (Why is no real title available?)
- On the hardness of computing maximum self-reduction sequences
This page was built for publication: On reductions for the Steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876697)
