Two trees are better than one
From MaRDI portal
Cites work
- A New Bound for the Steiner Ratio
- Abstract sphere-of-influence graphs
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
- Computational geometry. Algorithms and applications.
- Convex independent sets and 7-holes in restricted planar point sets
- How Long Can a Euclidean Traveling Salesman Tour Be?
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- scientific article; zbMATH DE number 3520428 (Why is no real title available?)
- scientific article; zbMATH DE number 1054785 (Why is no real title available?)
- scientific article; zbMATH DE number 835734 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Lagerungen
- On decomposition of graphs
- On metric Ramsey-type phenomena
- On the Best Constant for the Besicovitch Covering Theorem
- On the Decomposition of Graphs
- On the Shortest Path Through a Number of Points
- Research Problems in Discrete Geometry
- Steiner Minimal Trees
- The shortest path and the shortest road through n points
- Über einen geometrischen Satz.
This page was built for publication: Two trees are better than one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918444)
