The Euclidean k-supplier problem in IR²

Authors

Manjanna Basappa, Birla Institute of Technology and Science, Pilani
Ramesh K. Jallu, Academy of Sciences of the Czech Republic
Gautam K. Das, Indian Institute of Technology Guwahati
Subhas C. Nandy, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Operations Research Letters

Abstract

Here we propose a fixed-parameter tractable (FPT) algorithm for the k-supplier problem with n clients and m facilities in R2. The algorithm produces a (1+ϵ)-factor approximation result in O((max{8ϵ−2,1})k(n+m)log(mn)) time. The running time is an exponential function of the parameter k for 0<ϵ<22. Next we propose Voronoi diagram based heuristic algorithm for the same problem. We also produce experimental results of the heuristic algorithm, and compare with the available best known result [Nagarajan et al., 2020].

First Page

48

Last Page

54

DOI

10.1016/j.orl.2020.10.008

Publication Date

1-1-2021

Recommended Citation

Basappa, Manjanna; Jallu, Ramesh K.; Das, Gautam K.; and Nandy, Subhas C., "The Euclidean k-supplier problem in IR²" (2021). Journal Articles. 2243.
https://digitalcommons.isical.ac.in/journal-articles/2243