Pages that link to "Item:Q1827846"
From MaRDI portal
The following pages link to Continuous bottleneck tree partitioning problems (Q1827846):
Displaying 9 items.
- Constant-competitive tree node assignment (Q391778) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
- Continuous graph partitioning for camera network surveillance (Q2342775) (← links)
- New Upper Bounds on Continuous Tree Edge-Partition Problem (Q3511413) (← links)
- Optimality of consecutive and nested tree partitions (Q4361177) (← links)
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS (Q5471480) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)