An initial study of budgeted Steiner networks
From MaRDI portal
Recommendations
Cites work
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- Combinatorics. Proceedings of the 5th Czech and Slovak symposium on combinatorics, graph theory, algorithms and applications, Prague, Czech Republic, July 6--11, 1998
- Euclidean Steiner minimum trees: An improved exact algorithm
- scientific article; zbMATH DE number 1424547 (Why is no real title available?)
- Link-Length Minimization in Networks
- On minimal graphs containing n given points
- On the history of the Euclidean Steiner tree problem
- On the Problem of Steiner
- Optimum Communication Spanning Trees
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Reducibility among combinatorial problems
- Steiner Minimal Trees
- Steiner problem in networks: A survey
- Steiner tree problems
- The complexity of the network design problem
- The complexity of theorem-proving procedures
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Wiener index of trees: Theory and applications
This page was built for publication: An initial study of budgeted Steiner networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179336)