A network flow implementation of a modified work function algorithm for solving the k-server problem (CROSBI ID 533042)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Baumgartner, Alfonzo ; Manger, Robert ; Hocenski, Željko
engleski
A network flow implementation of a modified work function algorithm for solving the k-server problem
We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. In this paper we describe in detail a network flow implementation of the modified WFA. We also present theoretical estimates and experimental measurements dealing with the computational complexity of the implemented algorithm.
on-line problems; on-line algorithms; k-server problem; work function algorithm (WFA); moving windows; implementation; network flows; computational complexity
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
83-90.
2007.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the 8th International Symposium on Operational Research in Slovenia (SOR'07)
Zadnik Stirn, Lidija ; Drobne, Samo
Ljubljana: Slovensko društvo informatika
Podaci o skupu
International Symposium on Operational Research in Slovenia (8 ; 2007)
predavanje
26.09.2007-28.09.2007
Nova Gorica, Slovenija