New Upper Bounds on Continuous Tree Edge-Partition Problem

  • Robert Benkoczi
  • Binay Bhattacharya
  • Qiaosheng Shi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)


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].


Tree Network Feasibility Test Upper Bound Cluster Vertex Leaf Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Benkoczi, R.: Cardinality constrainted facility location problems in trees, Ph.D. Thesis, School of computing secience, SFU, Canada (2004)Google Scholar
  2. 2.
    Blum, M., Floyd, R.W., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci. 7(4), 448–461 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Halman, N., Tamir, A.: Continuous bottleneck tree partitioning problems. Disc. App. Math. 140, 185–206 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Lin, J.-J., Chan, C.-Y., Wang, B.-F.: Improved algorithms for the continuous tree edge-partition problems. Disc. App. Math. (submitted, 2007)Google Scholar
  6. 6.
    McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852–865 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput. 4, 348–355 (1975)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Robert Benkoczi
    • 1
  • Binay Bhattacharya
    • 2
  • Qiaosheng Shi
    • 2
  1. 1.Mathematics and Computer ScienceUniversity of LethbridgeLethbridgeCanada
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnaby B.C.Canada

Personalised recommendations