The minimum-area spanning tree problem
From MaRDI portal
Publication:2432736
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1500550 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- Introduction to algorithms
- On the History of the Minimum Spanning Tree Problem
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
- Performance guarantees for the TSP with a parameterized triangle inequality
- Power consumption in packet radio networks
- Topics in Intersection Graph Theory
Cited in
(9)- Algorithms and Data Structures
- Faster algorithms for some optimization problems on collinear points
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Minimum spanning tree cycle intersection problem
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- On the Topologies of Local Minimum Spanning Trees
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
- The Minimum Spanning Tree Constraint
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)