Pages that link to "Item:Q686520"
From MaRDI portal
The following pages link to A shifting algorithm for constrained min-max partition on trees (Q686520):
Displaying 23 items.
- Minimum height path partitioning of trees (Q555536) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Efficient implementation of a shifting algorithm (Q1070825) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- Clustering on trees (Q1392041) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
- The shifting algorithm technique for the partitioning of trees (Q1900135) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- (Q3334089) (← links)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
- Approximation Algorithms for Min–Max Tree Partition (Q4360130) (← links)
- Optimality of consecutive and nested tree partitions (Q4361177) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
