Abstract
In this paper, we present approximation algorithms for solving the line facility location problem in weighted regions. 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aleksandrov L, Djidjev HN, Guo H, Maheshwari A, Nussbaum D, Sack JR (2009) Algorithms for approximate shortest path Queries on weighted polyhedral surfaces. Discrete Comput. Geom. doi:10.1007/s0454-009-9204-0
Aleksandrov L, Maheshwari AA, Sack JR (2000) Approximation algorithms for geometric shortest path problems. In: Proc 32nd annual ACM symposium on theory of computing, pp 286–295
Aleksandrov L, Maheshwari A, Sack JR (2005) Determining approximate shortest paths on weighted polyhedral surfaces. J ACM 52(1):25–53
Amato NM, Goodrich MT, Ramos EA (2000) Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. In: Proc 11th annual CAM-SIAM symposium on discrete algorithms, pp 705–706
Chen DZ, Daescu O, Hu X, Wu X, Xu J (2001) Determining an optimal penetration among weighted regions in two and three dimensions. J Comb Optim 5(1):59–79
Chen DZ, Hu X, Xu J (2003) Computing optimal beams in two and three dimensions. J Comb Opt 7(2):111–136
Cheng SW, Na HS, Vigneron A, Wang Y (2007) Approximate shortest paths in anisotropic regions. In: Proc 18th annual ACM-SIAM symposium on discrete algorithms, pp 766–774
Cheng SW, Na HS, Vigneron A, Wang Y (2005) Querying approximate shortest paths in anisotropic regions. In: Proc 23rd annual symposium on computational geometry, pp 84–91
Cheung Y, Daescu O (2008) Line facility location in weighted regions. In: Proc 4th intl conf on algorithmic aspects in information and management, pp 109–119
Cheung Y, Daescu O, Kurdia A (2008) A new modeling for finding optimal weighted distances. In: Proc 2008 international conference on biocomputation, bioinformatics, and biomedical technologies (BIOTECHNO’08), pp 41–46
Cheung Y, Daescu O, Palmer JD (2009) Parallel optimal weighted links. Trans Comput Sci 3:66–81
Daescu O (2002) Improved optimal weighted links algorithms. In: Proc ICCS, 2nd international workshop on computational geometry and applications, pp 227–233
Daescu O, Palmer J (2009) Minimum separation in weighted subdivisions. Int J Comput Geom Appl 19(1):33–57
Imai H, Kato K, Yamamoto P (1989) A linear-time algorithm for linear L 1 approximation of points. Algorithmica 4(1):77–96
Goemans MX, Skutella M (2000) Cooperative facility location games. In: Proc 11th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 76–85
Megiddo N, Tamir A (1983) Finding least-distance lines. SIAM J Algebraic Discrete Methods 4(2):207–211
Mitchell JSB, Papdimitriou CH (1991) The weighted region problem: Finding shortest paths through a weighted planer subdivision. J ACM 38(1):18–73
Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, New York
Sun Z, Reif JH (2006) On finding approximate optimal path in weighted regions. J Algorithms 58(1):1–32
Toussaint GT (1983) Solving geometric problems with the ‘rotating calipers’. In: Proc 2nd IEEE Mediterranean electrotechnical conference (MELECON’83), pp A10.02/1–4
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by NSF grant CCF-0635013.
Rights and permissions
About this article
Cite this article
Cheung, Y.K., Daescu, O. Line facility location in weighted regions. J Comb Optim 22, 52–70 (2011). https://doi.org/10.1007/s10878-009-9272-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9272-3