Pages that link to "Item:Q2344217"
From MaRDI portal
The following pages link to On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217):
Displaying 16 items.
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Minimum spanning trees in networks with varying edge weights (Q863566) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES (Q4312279) (← links)
- Minimum Spanning Tree with Neighborhoods (Q5434449) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- On hub location problems in geographically flexible networks (Q6071054) (← links)
- (Q6159345) (← links)
- (Q6179335) (← links)