Minimum Spanning Tree with Neighborhoods
From MaRDI portal
Recommendations
- Minimum spanning trees
- Minimal spanning trees
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- Minimum spanning hypertrees
- Spanning trees with minimum weighted degrees
- Low-degree minimum spanning trees
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Minimum bottleneck spanning trees with degree bounds
Cited in
(18)- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Minimum spanning tree of line segments
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Routing for unmanned aerial vehicles: touring dimensional sets
- Minimum cost b-matching problems with neighborhoods
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Ordered \(p\)-median problems with neighbourhoods
- The minimum-area spanning tree problem
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
- The minimum spanning tree problem with non-terminal set
- A survey on relay placement with runtime and approximation guarantees
- Algorithms and Data Structures
- The Minimum Moving Spanning Tree Problem
- Facility location problems on graphs with non-convex neighborhoods
- scientific article; zbMATH DE number 7691269 (Why is no real title available?)
- Shortest Paths in Graphs of Convex Sets
This page was built for publication: Minimum Spanning Tree with Neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434449)