The shifting algorithm technique for the partitioning of trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3503273 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3448061 (Why is no real title available?)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- A shifting algorithm for constrained min-max partition on trees
- Circuit partitioning with size and connection constraints
- Efficient Optimization of Monotonic Functions on Trees
- Efficient implementation of a shifting algorithm
- Max-Min Tree Partitioning
- Most uniform path partitioning and its use in image processing
- Parallel concepts in graph theory
- Shifting algorithms for tree partitioning with general weighting functions
Cited in
(17)- Improved algorithms for path partition and related problems
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- Subset sum problems with digraph constraints
- Divider-based algorithms for hierarchical tree partitioning.
- Cardinality constrained connected balanced partitions of trees under different criteria
- Uniform and most uniform partitions of trees
- Path equipartition in the Chebyshev norm
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- An algorithm for partitioning trees augmented with sibling edges
- Partitioning of trees for minimizing height and cardinality
- On the complexity of isoperimetric problems on trees
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- On the uniform edge-partition of a tree
- Algorithms for uniform centered partitions of trees
- Efficient implementation of a shifting algorithm
This page was built for publication: The shifting algorithm technique for the partitioning of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900135)
