Approximation Algorithms for Min–Max Tree Partition

DOI10.1006/JAGM.1996.0848MaRDI QIDQ4360130zbMATH OpenOpenAlexFDO

Authors Nili Guttmann-Beck, Refael Hassin

Publication date 16 December 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0848

zbMATH Keywords

min-max tree partition problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Approximation algorithms for minimum tree partition
• Approximation algorithms for min-sum \(p\)-clustering
• Balanced partitions of trees and applications
• A shifting algorithm for constrained min-max partition on trees

Cited in

(27)

• Approximation algorithms for minimum tree partition
• Approximation algorithms for min-sum \(p\)-clustering
• On the complexity of graph tree partition problems.
• Continuous bottleneck tree partitioning problems
• Approximation algorithms for the maximally balanced connected graph tripartition problem
• On the complexity of partitioning a graph into a few connected subgraphs
• Approximation algorithms for generalized bounded tree cover
• Minimum Cost Partitions of Trees with Supply and Demand
• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• Approximating minimum k-section in trees with linear diameter
• scientific article; zbMATH DE number 3866593 (Why is no real title available?)
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Parameterized Minimum Cost Partition of a Tree with Supply and Demand
• Minimax Trees in Linear Time with Applications
• Balanced Partition of Minimum Spanning Trees
• BALANCED PARTITION OF MINIMUM SPANNING TREES
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Minmax tree cover in the Euclidean space
• Minmax Tree Cover in the Euclidean Space
• scientific article; zbMATH DE number 7758357 (Why is no real title available?)
• Approximating minimum k-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks
• Approximation algorithms for the capacitated min-max and minimum graph cover problems
• Min-max tree covers of graphs.
• Quantum error correction in Kitaev's quantum double model for abelian groups
• Forest covers
• Approximation algorithms for the capacitated min-max and minimum graph cover problems
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

This page was built for publication: Approximation Algorithms for Min–Max Tree Partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360130)