The minimum-area spanning tree problem
DOI10.1016/J.COMGEO.2006.03.001zbMATH Open1102.65020OpenAlexW2058529268MaRDI QIDQ2432736FDOQ2432736
Joseph S. B. Mitchell, Paz Carmi, Matthew J. Katz
Publication date: 25 October 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.03.001
Recommendations
minimum spanning treeapproximation algorithmsgeometric optimizationdisk graphsrange assignmenttraveling salesperson problem
Numerical mathematical programming methods (65K05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Introduction to algorithms
- Topics in Intersection Graph Theory
- Title not available (Why is that?)
- Performance guarantees for the TSP with a parameterized triangle inequality
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- Power consumption in packet radio networks
- On the History of the Minimum Spanning Tree Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- On the Topologies of Local Minimum Spanning Trees
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- Title not available (Why is that?)
- The Minimum Spanning Tree Constraint
- Connecting a set of circles with minimum sum of radii
- Minimum spanning tree cycle intersection problem
- Algorithms and Data Structures
This page was built for publication: The minimum-area spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432736)
