Approximation algorithms for minimum tree partition
From MaRDI portal
Publication:1270776
DOI10.1016/S0166-218X(98)00052-3zbMath0906.68107MaRDI QIDQ1270776
Nili Guttmann-Beck, Refael Hassin
Publication date: 25 January 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On the complexity of graph tree partition problems. ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem ⋮ Approximating the maximum quadratic assignment problem
Cites Work
- Unnamed Item
- An efficient approximation algorithm for the survivable network design problem
- A greedy heuristic for a minimum-weight forest problem
- Approximating minimum-cost graph problems with spanning tree edges
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Approximation Algorithms for Min–Max Tree Partition
- A General Approximation Technique for Constrained Forest Problems
- Facility dispersion and remote subgraphs
- Optimal assignments in an ordered set: An application of matroid theory
This page was built for publication: Approximation algorithms for minimum tree partition
