The Euclidean k-Supplier problem in R^2

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F21%3A00534839" target="_blank" >RIV/67985807:_____/21:00534839 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.orl.2020.10.008" target="_blank" >http://dx.doi.org/10.1016/j.orl.2020.10.008</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.orl.2020.10.008" target="_blank" >10.1016/j.orl.2020.10.008</a>

Result language
angličtina
Original language name
The Euclidean k-Supplier problem in R^2
Original language description
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].
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)