Approximation Algorithms for Min–Max Tree Partition

DOI10.1006/jagm.1996.0848zbMath0888.68047OpenAlexW2060460330MaRDI QIDQ4360130

Refael Hassin, Nili Guttmann-Beck

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)

Related Items (10)

BALANCED PARTITION OF MINIMUM SPANNING TREES ⋮ Unnamed Item ⋮ On the complexity of graph tree partition problems. ⋮ Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems ⋮ Min-max tree covers of graphs. ⋮ Approximation Algorithms for Generalized Bounded Tree Cover ⋮ Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems ⋮ Approximation algorithms for minimum tree partition ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem ⋮ On the complexity of partitioning a graph into a few connected subgraphs

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