Line Facility Location in Weighted Regions

Authors:
Yam Ki Cheung;Ovidiu Daescu
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 4
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Cooperative facility location games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Line Segment Facility Location in Weighted Subdivisions

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Line facility location in weighted regions

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present approximation algorithms for the line facility location problem in weighted regions: Given lfixed points in a 2-dimensional weighted subdivision of the plane, with nvertices, find a line Lsuch that the sum of the weighted distances from the fixed points to Lis 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.