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].
Supported by the Swedish Foundation for International Cooperation in Research and Higher Education
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
M. Andersson. Balanced Partition of Minimum Spanning Trees, LUNDFD6/NFCS-5215/1-30/2001, Master thesis, Department of Computer Science, Lund University, 2001.
B. Shaleooi. Algoritmer för plåtskärning (Eng. transl. Algorithms for cutting sheets of metal), LUNDFD6/NFCS-5189/1-44/2001, Master thesis, Department of Computer Science, Lund University, 2001.
M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979.
E. M. Arkin and R. Hassin. Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, 55:197–218, 1994.
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001.
M. R. Garey, R. L. Graham and D. S. Johnson. Some NP-complete geometric problems. In Proc. 8th Annual ACM Symposium on Theory of Computing, 1976.
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6:469–488, 1999.
J. Gudmundsson and C. Levcopoulos. Hardness Result for TSP with Neighborhoods, Technical report, LU-CS-TR:2000-216, Department of Computer Science, Lund University, Sweden, 2000.
C. Mata and J. S. B. Mitchell. Approximation algorithms for geometric tour and network design problems. In Proc. 11th Annual ACM Symposium on Computational Geometry, pages 360–369, 1995.
J. S. B. Mitchell. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. SIAM Journal on Computing, 28(4):1298–1309, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersson, M., Gudmundsson, J., Levcopoulos, C., Narasimhan, G. (2002). Balanced Partition of Minimum Spanning Trees. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47789-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-47789-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43594-5
Online ISBN: 978-3-540-47789-1
eBook Packages: Springer Book Archive