Balanced Partition of Minimum Spanning Trees

Authors:
Mattias Andersson;Joachim Gudmundsson;Christos Levcopoulos;Giri Narasimhan
Affiliations:
-;-;-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Year:
2002

Citing 7
Cited 0

Approximation algorithms for the geometric covering salesman problem

Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Approximation algorithms for TSP with neighborhoods in the plane

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A fast approximation algorithm for TSP with neighborhoods

Nordic Journal of Computing
Some NP-complete geometric problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve "optimally" dividing a task into k smaller tasks. We consider the problem of partitioning a given set S of n points (in the plane) into k subsets, S1,...,Sk, such that max1驴i驴k|MST(Si)| is minimized. A variant of this problem arises in the shipbuilding industry [2].