Abstract
In this paper we present approximation algorithms for solving the line segment 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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Cheung, Y. K., & Daescu, O. (2009). Line segment facility location in weighted subdivisions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5564 LNCS, pp. 100–113). https://doi.org/10.1007/978-3-642-02158-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
