Pages that link to "Item:Q1900135"
From MaRDI portal
The following pages link to The shifting algorithm technique for the partitioning of trees (Q1900135):
Displayed 15 items.
- Improved algorithms for path partition and related problems (Q408433) (← links)
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Partitioning of trees for minimizing height and cardinality (Q1029076) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- (Q5708519) (← 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)