期刊
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH
卷 23, 期 3, 页码 699-722出版社
SPRINGER
DOI: 10.1007/s10100-014-0349-4
关键词
Combinatorial optimization; On-line computation; k-server problem; Work function algorithm; Implementation; Network flows; Cost reduction
In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the -server problem. Our implementation is based on network flow techniques, a novel network model, and flow cost reduction. Also, it is provided with a parameter that enables tradeoff between accuracy and speed. In the paper we present experiments, showing that the new implementation can mimic perfectly the original WFA and still run at least an order of magnitude faster than any known exact implementation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据