Skip to main content
SpringerLink
Log in

Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles

Extended Abstract

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1533))

Included in the following conference series:

Abstract

Given a set B of obstacles and a set S of source points in the plane, the problem of finding a set of points subject to a certain objective function with respect to B and S is a basic problem in applications such as facility location problem 5.

This work is partially supported by KOSEF, Grant No. 98-0102-07-01-3.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, SIAM J. Comput., 18:499–532, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  2. V. Chepoi and F. Dragan, Computing a median point of a simple rectilinear polygon, Inform. Process. Lett., 49:281–285, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, SIAM J. Comput., 15:725–738, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. J. deRezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths in the presence of rectilinear barriers, Discrete Comput. Geom., 4:41–53, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. L. Francis and J. A. White, Facility Layout and Location, Prentice Hall, Englewood Cliffs, NJ, 1974.

    Google Scholar 

  6. M. T. Ko and R. C. T. Lee, On weighted rectilinear 2-center and 3-center problems, Inform. Sci., 54:169–190, 1991. 30

    Article  MathSciNet  MATH  Google Scholar 

  7. Y. Kusakari and T. Nishizeki, An algorithm for finding a region with the minimum total L 1-distance from prescribed terminals, Proc. of ISAAC’97, Lecture Notes in Computer Science, Springer-Verlag, 324–333, 1997.

    Google Scholar 

  8. R. C. Larson and G. Sadiq, Facility locations with the Manhattan metric in the presence of barriers to travel, Oper. Res., 31:652–669, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30:852–865, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Sharir and E. Welzl, Rectilinear and polygonal p-piercing and p-center problems, Proc. 12th ACM Symp. Comput. Geom., 122–132, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Comp. Sci., Kookmin U., Korea

    Joonsoo Choi

  2. Dept. of Comp. Sci., KAIST, Korea

    Chan-Su Shin

  3. Dept. of Comp. Sci. Eng., Chung-Ang U., Korea

    Sung Kwon Kim

Authors
  1. Joonsoo Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chan-Su Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sung Kwon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choi, J., Shin, CS., Kim, S.K. (1998). Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation