Skip to main content
SpringerLink
Log in

Computing the Line-Constrained k-center in the Plane for Small k

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2016)

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

Included in the following conference series:

Abstract

In this paper, we study the line-constrained k-center problem in the Euclidean plane. Given a set of demand points and a line L, the problem asks for k points, called center facilities, on L, such that the maximum of the distances from the demand points to their closest center facilities is minimized. For any fixed k, we propose an algorithm with running time linear to the number of demand points.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    As indicated in Sect. 4, what we need is an algorithm for solving small instances.

References

  1. Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. Discrete Comput. Geom. 20(3), 287–305 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Moshe, B., Bhattacharya, B.K., Shi, Q.: An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 166–177. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Bhattacharya, B., Shi, Q.: Optimal algorithms for the weighted p-center problems on the real line for small p. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 529–540. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Brass, P., Knauer, C., Na, H.-S., Shin, C.-S., Vigneron, A.: The aligned \(k\)-center problem. IJCGA 21(2), 157–178 (2011)

    MathSciNet  MATH  Google Scholar 

  5. Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13, 189–198 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hoffmann, M.: A simple linear algorithm for computing rectilinear 3-centers. Comput. Geom. 31(3), 150–165 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Karmakar, A., Das, S., Nandy, S.C., Bhattacharya, B.: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2), 176–190 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kim, S.K., Shin, C.-S.: Efficient algorithms for two-center problems for a convex polygon. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299–309. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Megiddo, N.: Linear-time algorithms for linear programming in \(r^3\) and related problems. SIAM J. Comput. 12(4), 759–776 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problem. SIAM J. Comput. 13(1), 182–196 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wang, H., Zhang, J.: Line-constrained k-median, k-means, and k-center problems in the plane. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 3–14. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Acknowledgments

Albert Jhih-Heng Huang and Kun-Mao Chao were supported in part by MOST grants 101-2221-E-002-063-MY3 and 103-2221-E-002-157-MY3, and Hung-Lung Wang was supported in part by MOST grant 103-2221-E-141-004 from the Ministry of Science and Technology, Taiwan.

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

    Albert Jhih-Heng Huang & Kun-Mao Chao

  2. Institute of Information and Decision Sciences, National Taipei University of Business, Taipei, Taiwan

    Hung-Lung Wang

Authors
  1. Albert Jhih-Heng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hung-Lung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kun-Mao Chao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hung-Lung Wang .

Editor information

Editors and Affiliations

  1. Università degli Studi di Bergamo , Bergamo, Italy

    Riccardo Dondi

  2. Université de Nantes , Nantes, France

    Guillaume Fertin

  3. Università degli Studi di Milano-Bicocca , Milano, Italy

    Giancarlo Mauri

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Huang, A.JH., Wang, HL., Chao, KM. (2016). Computing the Line-Constrained k-center in the Plane for Small k . In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41168-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41167-5

  • Online ISBN: 978-3-319-41168-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation