The shifting algorithm technique for the partitioning of trees
From MaRDI portal
Publication:1900135
DOI10.1016/0166-218X(94)00143-2zbMATH Open0833.68088MaRDI QIDQ1900135FDOQ1900135
Authors: Yehoshua Perl, Ronald I. Becker 
Publication date: 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Most uniform path partitioning and its use in image processing
- Parallel concepts in graph theory
- Max-Min Tree Partitioning
- Title not available (Why is that?)
- Efficient implementation of a shifting algorithm
- Title not available (Why is that?)
- Shifting algorithms for tree partitioning with general weighting functions
- Efficient Optimization of Monotonic Functions on Trees
- Circuit partitioning with size and connection constraints
- A shifting algorithm for constrained min-max partition on trees
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
Cited In (17)
- Improved algorithms for path partition and related problems
- Title not available (Why is that?)
- 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
- On the uniform edge-partition of a tree
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Algorithms for uniform centered partitions of trees
- Efficient implementation of a shifting algorithm
Uses Software
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)
