Abstract
Let G = (V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set \(\mathcal{T}\) of k trees of the graph so that the ratio α of \(\max_{T\in \mathcal{T}}w(T)\) to w(T *)/k is minimized, where T * denotes a minimum spanning tree of G. The problem has been used as a core analysis in designing approximation algorithms for several types of graph partitioning problems over metric spaces, and the performance guarantees depend on the ratio α of the corresponding balanced tree partitioning problems. It is known that the best possible value of α is 2 for the general metric space. In this paper, we study the problem in the d-dimensional Euclidean space ℝd, and break the bound 2 on α, showing that \(\alpha <2\sqrt{3}-3/2 \fallingdotseq 1.964\) for d ≥ 3 and \(\alpha <(13 + \sqrt{109})/12 \fallingdotseq 1.953\) for d = 2. These new results enable us to directly improve the performance guarantees of several existing approximation algorithms for graph partitioning problems if the metric space is an Euclidean space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersson, M., Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Balanced partition of minimum spanning trees. International Journal of Computational Geometry and Applications 13, 303–316 (2003)
Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minmax routing of two traveling salesman on a tree. Discrete Applied Mathematics 68, 17–32 (1996)
Averbakh, I., Berman, O.: (p − 1)/(p + 1)-approximate algorithm for p-traveling salesman problems on a tree with minmax objective. Discrete Applied Mathematics 75, 201–216 (1997)
Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristics and adaptive memory procedure for political districting. European J. Operation Research 144, 12–26 (2003)
Bruno, J., Downey, P.: Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput. 7, 393–581 (1978)
Cordone, R., Maffioli, F.: On the complexity of graph tree partition problems. Discrete Applied Mathematics 134, 51–65 (2004)
Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Research Letters 32, 309–315 (2004)
Karakawa, S., Morsy, E., Nagamochi, H.: Minmax Tree Cover in the Euclidean Space. Technical Report, 2008-013, Discrete Mathematics Lab., Graduate School of Informatics, Kyoto University, http://www.amp.i.kyoto-u.ac.jp/tecrep/TR2008.html
Karuno, Y., Nagamochi, H.: 2-approximation algorithms for the multi-vehicle scheduling on a path with release and handling times. Discrete Applied Mathematics 129, 433–447 (2003)
Karuno, Y., Nagamochi, H.: Scheduling vehicles on trees. Pacific J. Optim. 1, 527–543 (2005)
Karuno, Y., Nagamochi, H.: Vehicle scheduling problems in graphs. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch. 46. Chapman & Hall/CRC, Boca Raton (2007)
Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Trans. Fundamentals E88-A(5), 1335–1338 (2005)
Nagamochi, H., Kawada, T.: Minmax subtree cover problem on cacti. Discrete Applied Mathematics 154(8), 1254–1263 (2006)
Nagamochi, H., Okada, K.: Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 138–147. Springer, Heidelberg (2003)
Nagamochi, H., Okada, K.: A faster 2-approximation algorithm for the minmax p-traveling salesman problem on a tree. Discrete Applied Mathematics 140, 103–114 (2004)
Nagamochi, H., Okada, K.: Approximating the minmax rooted-tree cover in a tree. Information Processing Letters 104, 173–1178 (2007)
Williams Jr., J.C.: Political districting: a review. Papers in Regional Science 74, 12–40 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karakawa, S., Morsy, E., Nagamochi, H. (2009). Minmax Tree Cover in the Euclidean Space. In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-00202-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00201-4
Online ISBN: 978-3-642-00202-1
eBook Packages: Computer ScienceComputer Science (R0)