Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
KŮDELA, J.
Originální název
Social Distancing as p-Dispersion Problem
Typ
článek v časopise ve Web of Science, Jimp
Jazyk
angličtina
Originální abstrakt
The spread of COVID-19 and similar viruses poses new challenges for our society. There is a strong incentive towards safety measures that help to mitigate the outbreaks. Many countries have imposed social distancing measures that require a minimum distance between people in given places, such as schools, restaurants, shops, etc. This in turn creates complications for these places, as their function is to serve as many people as they were originally designed for. In this paper, we pose the problem of using the available space in a given place, such that the social distancing measures are satisfied, as a p-dispersion problem. We use recent algorithmic advancements, that were developed for the p-dispersion problem, and combine them with discretization schemes to find computationally attainable solutions to the p-dispersion problem and investigate the trade-off between the level of discretization and computational efforts on one side, and the value of the optimal solution on the other.
Klíčová slova
social distancing; p-dispersion problem; decremental clustering; COVID-19
Autoři
Vydáno
14. 8. 2020
Nakladatel
IEEE
ISSN
2169-3536
Periodikum
IEEE Access
Ročník
8
Číslo
1
Stát
Spojené státy americké
Strany od
149402
Strany do
149411
Strany počet
10
URL
https://ieeexplore.ieee.org/document/9167199
Plný text v Digitální knihovně
http://hdl.handle.net/11012/196567
BibTex
@article{BUT164727, author="Jakub {Kůdela}", title="Social Distancing as p-Dispersion Problem", journal="IEEE Access", year="2020", volume="8", number="1", pages="149402--149411", doi="10.1109/ACCESS.2020.3016724", issn="2169-3536", url="https://ieeexplore.ieee.org/document/9167199" }