A new approach to solve the k-server problem based on network flows and flow cost reduction

This paper is concerned with two algorithms for solving the k-server problem: the optimal off-line algorithm (OPT) and the on-line work function algorithm (WFA). Both algorithms are usually implemented by network flow techniques including the flow augmentation method. In the paper a new implementati...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 40; číslo 4; s. 1004 - 1013
Hlavní autori:	Rudec, Tomislav, Manger, Robert
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Kidlington Elsevier Ltd 01.04.2013 Elsevier Pergamon Press Inc
Predmet:	Algorithms Applied sciences Augmentation Cost reduction Exact sciences and technology Experiments Flows in networks. Combinatorial problems Implementation k-server problem Mathematical functions Network flow problem Network flows Networks On-line problems On-line systems Operational research and scientific management Operational research. Management science Operations research Optimal off-line algorithm Optimization Optimization algorithms Studies Work function algorithm Work functions Work function algorithm On-line problems Cost reduction k-server problem Optimal off-line algorithm Network flows Experiments Implementation On line Network flow Optimal algorithm Work function Indirect method Off line Cost lowering
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!