Line Facility Location in Weighted Regions

  • Yam Ki Cheung
  • Ovidiu Daescu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)


In this paper, we present approximation algorithms for the line facility location problem in weighted regions: Given l fixed points in a 2-dimensional weighted subdivision of the plane, with n vertices, find a line L such that the sum of the weighted distances from the fixed points to L is minimized. The weighted region setup is a more realistic model for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that could possibly be used for solving other problems in weighted regions.


Facility Location Facility Location Problem Steiner Point Weighted Region Event Point 
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.
    Amato, N.M., Goodrich, M.T., Ramos, E.A.: Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In: Proc. 11th Annual CAM-SIAM Symposium on Discrete Algorithms, 2000, pp. 705–706 (2000)Google Scholar
  2. 2.
    Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. J. combinat. Optim. 5(1), 59–79 (2001)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Chen, D.Z., Hu, X., Xu, J.: Computing Beams in Two and Three Dimensions. Journal of Combinatorial Optimization 7, 111–136 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Daescu, O.: Improved optimal weighted links algorithms. In: Proceedings of ICCS, 2nd International Workshop on Computational Geometry and Applications, pp. 227–233 (2002)Google Scholar
  5. 5.
    Daescu, O., Palmer, J.: Minimum Separation in Weighted Subdivisions. The International J. Computat. Geom. & Appl. (Submitted, 2003) (Manuscript)Google Scholar
  6. 6.
    Michel, X.: Cooperative facility location games. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms SODA 2000(2000)Google Scholar
  7. 7.
    Megiddo, N., Tamir, A.: Finding Least-Distance Lines. SIAM J. ALG. DISC. MATH. 4(2) (1983)Google Scholar
  8. 8.
    Mitchell, J.S.B., Papdimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planer subdivision. Journal of the ACM 38(1), 18–73 (1991)zbMATHCrossRefGoogle Scholar
  9. 9.
    Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yam Ki Cheung
    • 1
  • Ovidiu Daescu
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Personalised recommendations