Abstract
We consider continuous tree edge-partition problem on a edge-weighted tree network. A continuous p-edge-partition of a tree is to divide it into p subtrees by selecting p − 1 cut points along the edges of the underlying tree. The objective is to maximize (minimize) the minimum (maximum) length of the subtrees. We present an O(nlog2 n)-time algorithm for the max-min problem which is based on parametric search technique [7] and an efficient solution to the ratio search problem. Similar algorithmic technique, when applied to the min-max problem, results in an O(nh T logn)-time algorithm where h T is the height of the underlying tree network. The previous results for both max-min and min-max problems are O(n 2) [5].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benkoczi, R.: Cardinality constrainted facility location problems in trees, Ph.D. Thesis, School of computing secience, SFU, Canada (2004)
Blum, M., Floyd, R.W., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci. 7(4), 448–461 (1973)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)
Halman, N., Tamir, A.: Continuous bottleneck tree partitioning problems. Disc. App. Math. 140, 185–206 (2004)
Lin, J.-J., Chan, C.-Y., Wang, B.-F.: Improved algorithms for the continuous tree edge-partition problems. Disc. App. Math. (submitted, 2007)
McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)
Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852–865 (1983)
Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput. 4, 348–355 (1975)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benkoczi, R., Bhattacharya, B., Shi, Q. (2008). New Upper Bounds on Continuous Tree Edge-Partition Problem. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)