Shifting algorithms for tree partitioning with general weighting functions
From MaRDI portal
Publication:3667953
DOI10.1016/0196-6774(83)90039-1zbMath0518.68036OpenAlexW2053181263MaRDI QIDQ3667953
Yehoshua Perl, Ronald I. Becker
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90039-1
Related Items
Tree edge decomposition with an application to minimum ultrametric tree approximation, On the uniform edge-partition of a tree, A subexponential algorithm for the coloured tree partition problem, The shifting algorithm technique for the partitioning of trees, Approximation algorithms for the maximum bounded connected bipartition problem, A tight bound on the min-ratio edge-partitioning problem of a tree, Approximation and parameterized algorithms for balanced connected partition problems, Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows, Balanced connected partitions of graphs: approximation, parameterization and lower bounds, A linear-time algorithm for finding an edge-partition with max-min ratio at most two, A shifting algorithm for constrained min-max partition on trees, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, Efficient Optimization of Monotonic Functions on Trees, Partitioning a graph into balanced connected classes: formulations, separation and experiments, Most uniform path partitioning and its use in image processing, On a 2-dimensional equipartition problem, Path equipartition in the Chebyshev norm, Continuous bottleneck tree partitioning problems, Combinatorial approximation algorithms for the maximum bounded connected bipartition problem, Efficient implementation of a shifting algorithm
