Мақаланы E-mail арқылы жіберу Genetic local search and hardness of approximation for the server load balancing problem
- Авторлар: Kochetov Y.A.1,2, Panin A.A.1,2, Plyasunov A.V.1,2
-
Мекемелер:
- Novosibirsk State University
- Sobolev Institute of Mathematics, Siberian Branch
- Шығарылым: Том 78, № 3 (2017)
- Беттер: 425-434
- Бөлім: Stochastic Systems, Queueing Systems
- URL: https://journals.rcsi.science/0005-1179/article/view/150555
- DOI: https://doi.org/10.1134/S0005117917030043
- ID: 150555
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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.
Негізгі сөздер
Авторлар туралы
Yu. Kochetov
Novosibirsk State University; Sobolev Institute of Mathematics, Siberian Branch
Хат алмасуға жауапты Автор.
Email: jkochet@math.nsc.ru
Ресей, Novosibirsk; Novosibirsk
A. Panin
Novosibirsk State University; Sobolev Institute of Mathematics, Siberian Branch
Email: jkochet@math.nsc.ru
Ресей, Novosibirsk; Novosibirsk
A. Plyasunov
Novosibirsk State University; Sobolev Institute of Mathematics, Siberian Branch
Email: jkochet@math.nsc.ru
Ресей, Novosibirsk; Novosibirsk
Қосымша файлдар
