A shifting algorithm for constrained min-max partition on trees
DOI10.1016/0166-218X(93)90137-DzbMATH Open0797.68128MaRDI QIDQ686520FDOQ686520
Authors: Eliezer Agasi, Ronald I. Becker, Yehoshua Perl 
Publication date: 2 December 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3866593
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
- Partitioning a weighted tree into subtrees with weights in a given range
- Cardinality constrained connected balanced partitions of trees under different criteria
NP-completepolynomial algorithmheight-constrained min-max problempartition on treessize-constrained min-max problem
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?)
- Parallel concepts in graph theory
- Max-Min Tree Partitioning
- A Shifting Algorithm for Min-Max Tree Partitioning
- Efficient implementation of a shifting algorithm
- Shifting algorithms for tree partitioning with general weighting functions
- Efficient Optimization of Monotonic Functions on Trees
- Circuit partitioning with size and connection constraints
Cited In (22)
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- A note on the minimum bounded edge-partition of a tree
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Minimum height path partitioning of trees
- Divider-based algorithms for hierarchical tree partitioning.
- Continuous bottleneck tree partitioning problems
- Cardinality constrained connected balanced partitions of trees under different criteria
- Uniform and most uniform partitions of trees
- 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
- The shifting algorithm technique for the partitioning of trees
- Most uniform path partitioning and its use in image processing
- Title not available (Why is that?)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- On the complexity of isoperimetric problems on trees
- Min-max optimization of several classical discrete optimization problems
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- A shifting algorithm for continuous tree partitioning
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Efficient implementation of a shifting algorithm
This page was built for publication: A shifting algorithm for constrained min-max partition on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686520)
