The Euclidean K-Supplier Problem In Ir2

Here we propose a fixed-parameter tractable (FPT) algorithm for the k-supplier problem with n clients and m facilities in R-2. The algorithm produces a (1 + epsilon)-factor approximation result in O((max{8 epsilon(-2),1})(k)(n+m) log(mn)) time. The running time is an exponential function of the parameter k for 0 < epsilon < 2 root 2. 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]. (c) 2020 Elsevier B.V. All rights reserved.