Line Segment Facility Location in Weighted Subdivisions

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 '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Year:
2009

Citing 11
Cited 0

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)
Approximation algorithms for geometric shortest path problems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Cooperative facility location games

Journal of Algorithms - Special issue: SODA 2000
Determining approximate shortest paths on weighted polyhedral surfaces

Journal of the ACM (JACM)
Querying approximate shortest paths in anisotropic regions

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Approximate Shortest Paths in Anisotropic Regions

SIAM Journal on Computing
Line Facility Location in Weighted Regions

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On finding approximate optimal paths in weighted regions

Journal of Algorithms
Approximate shortest path queries on weighted polyhedral surfaces

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.