Skip to main content
SpringerLink
Log in

An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees

  • Conference paper
LATIN 2006: Theoretical Informatics (LATIN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3887))

Included in the following conference series:

Abstract

In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the “trimming” technique of Megiddo [5] in a nontrivial way. This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)

    Article  MathSciNet  Google Scholar 

  2. Frederickson, G.N.: Parametric search and locating supply centers in trees. In: WADS, pp. 299–319 (1991)

    Google Scholar 

  3. Halman, N.: Discrete and lexicographic helly theorems and their relations to LPtype problems., Ph.D. Thesis, Tel Aviv Univ. (2004)

    Google Scholar 

  4. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput. 12(4), 759–776 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(n log 2n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput. 10(2), 328–337 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  7. Megiddo, N., Tamir, A.: New results on the complexity of p-center problems. SIAM J. Comput. 12(4), 751–758 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada

    Boaz Ben-Moshe, Binay Bhattacharya & Qiaosheng Shi

Authors
  1. Boaz Ben-Moshe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Binay Bhattacharya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiaosheng Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business, Universidad Adolfo Ibáñez, Chile

    José R. Correa

  2. Dept. of Computer Science, University of Chile, Blanco Encalada 2120, 3er piso, Santiago, Chile

    Alejandro Hevia

  3. Dept. Ing. Matemática & Ctr. de Modelamiento Matemático, UMI 2807 U. Chile–CNRS, Chile

    Marcos Kiwi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ben-Moshe, B., Bhattacharya, B., Shi, Q. (2006). An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_19

Download citation

  • DOI: https://doi.org/10.1007/11682462_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32755-4

  • Online ISBN: 978-3-540-32756-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation