scientific article; zbMATH DE number 7779752
From MaRDI portal
Publication:6179336
DOI10.57717/cgt.v2i2.26MaRDI QIDQ6179336
Publication date: 16 December 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- On the history of the Euclidean Steiner tree problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Optimum Communication Spanning Trees
- On the Problem of Steiner
- Steiner problem in networks: A survey
- The complexity of the network design problem
- Euclidean Steiner minimum trees: An improved exact algorithm
- On minimal graphs containing $n$ given points
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- Reducibility among Combinatorial Problems
- Link-Length Minimization in Networks
- Steiner Minimal Trees
- The complexity of theorem-proving procedures
- Combinatorics. Proceedings of the 5th Czech and Slovak symposium on combinatorics, graph theory, algorithms and applications, Prague, Czech Republic, July 6--11, 1998
- Wiener index of trees: Theory and applications
- Steiner tree problems
This page was built for publication:
