电邮这篇文章 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://ogarev-online.ru/0005-1179/article/view/150555
- DOI: https://doi.org/10.1134/S0005117917030043
- ID: 150555
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
补充文件
