Аннотация
We consider a well-known NP-hard server load balancing problem. We study the computational complexity of finding approximate solutions with guaranteed accuracy estimate. We show that this problem is Log-APX-hard with respect to PTAS reductions. To solve the problem, we develop an approximate method based on the ideas of genetic local search. We show results of computational experiments.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 425-434 |
Число страниц | 10 |
Журнал | Automation and Remote Control |
Том | 78 |
Номер выпуска | 3 |
DOI | |
Состояние | Опубликовано - 1 мар 2017 |