scientific article; zbMATH DE number 4049088
From MaRDI portal
Publication:3785980
Recommendations
Cited in
(23)- A note on A faster approximation algorithm for the Steiner problem in graphs
- An approach for the Steiner problem in directed graphs
- Path-distance heuristic for the Steiner problem in undirected networks
- Heuristics for the Steiner problem in graphs
- Steiner's problem in graphs: Heuristic methods
- Worst-case performance of some heuristics for Steiner's problem in directed graphs
- A robust and scalable algorithm for the Steiner problem in graphs
- A faster approximation algorithm for the Steiner tree problem in graphs
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
- scientific article; zbMATH DE number 426374 (Why is no real title available?)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- Approaches to the Steiner Problem in Networks
- On the approximability of dense Steiner problems
- scientific article; zbMATH DE number 125486 (Why is no real title available?)
- scientific article; zbMATH DE number 125502 (Why is no real title available?)
- scientific article; zbMATH DE number 4128830 (Why is no real title available?)
- The Steiner problem: a survey
- RNC-approximation algorithms for the steiner problem
- Numerical approximation of the Steiner problem in dimension 2 and 3
- A faster approximation algorithm for the Steiner problem in graphs
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- Approximations for the Steiner multicycle problem
- On efficient implementation of an approximation algorithm for the Steiner tree problem
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 Q3785980)
