Max-Min Tree Partitioning
From MaRDI portal
Cited in
(36)- A shifting algorithm for constrained min-max partition on trees
- An overview of graph covering and partitioning
- Balanced connected graph partition
- PARTITIONING TREES OF SUPPLY AND DEMAND
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- 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
- Path equipartition in the Chebyshev norm
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- The shifting algorithm technique for the partitioning of trees
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- A tight bound on the min-ratio edge-partitioning problem of a tree
- On the complexity of partitioning graphs into connected subgraphs
- Most uniform path partitioning and its use in image processing
- Tree edge decomposition with an application to minimum ultrametric tree approximation
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- On a 2-dimensional equipartition problem
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- A shifting algorithm for continuous tree partitioning
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- Approximations to clustering and subgraph problems on trees
- Approximation algorithms for the maximally balanced connected graph tripartition problem
- Approximation algorithms for maximally balanced connected graph partition
- Dispersion on trees
- On the uniform edge-partition of a tree
- Algorithms for uniform centered partitions of trees
- Approximation and parameterized algorithms for balanced connected partition problems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Partitioning a matrix to minimize the maximum cost
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
- Max-min weight balanced connected partition
- Efficient implementation of a shifting algorithm
This page was built for publication: Max-Min Tree Partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902511)
