Constant work-space algorithms for facility location problems

Authors

Binay K. Bhattacharya, Simon Fraser University
Minati De, Indian Institute of Technology Delhi
Subhas C. Nandy, Indian Statistical Institute, Kolkata
Sasanka Roy, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Discrete Applied Mathematics

Abstract

In this paper, we study some fundamental facility location problems from the space-efficient perspective. We show that 1-center problem in Euclidean space and in tree networks can be efficiently solved in constant-workspace model. We use a virtual pairing tree during the pruning stage that allows the maintenance of pruned elements. We also show that a feasible region during the prune-and-search process can always be maintained using O(1) space. These results realize the solutions to the problems in constant work-space model: linear programming in 2-d, 3-d, 2-center in trees, and largest disk inside a convex polygon.

First Page

456

Last Page

472

DOI

10.1016/j.dam.2020.01.040

Publication Date

9-15-2020

Recommended Citation

Bhattacharya, Binay K.; De, Minati; Nandy, Subhas C.; and Roy, Sasanka, "Constant work-space algorithms for facility location problems" (2020). Journal Articles. 134.
https://digitalcommons.isical.ac.in/journal-articles/134