BALANCED PARTITION OF MINIMUM SPANNING TREES
From MaRDI portal
Publication:4818586
DOI10.1142/S0218195903001190zbMath1093.68120MaRDI QIDQ4818586
Joachim Gudmundsson, Giri Narasimhan, Mattias Andersson, Christos Levcopoulos
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195903001190
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Minmax Tree Cover in the Euclidean Space, Approximation algorithms for the maximally balanced connected graph tripartition problem
Cites Work
- Unnamed Item
- Approximation algorithms for the Geometric Covering Salesman Problem
- A Shifting Algorithm for Min-Max Tree Partitioning
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Approximation Algorithms for Min–Max Tree Partition