The Euclidean [formula omitted]-supplier problem in [formula omitted

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].