dc.contributor.author | Roura Ferret, Salvador |
dc.contributor.author | Martínez Parra, Conrado |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2022-07-22T11:42:49Z |
dc.date.available | 2022-07-22T11:42:49Z |
dc.date.issued | 1996-11-27 |
dc.identifier.citation | Roura, S.; Martinez, C. New results about the list access problem. 1996. |
dc.identifier.uri | http://hdl.handle.net/2117/370906 |
dc.description.abstract | We consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). We present an off-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be k-competitive for any constant k, MTF included. |
dc.format.extent | 9 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-96-63-R |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.lcsh | Algorithms |
dc.title | New results about the list access problem |
dc.type | External research report |
dc.subject.lemac | Algorismes |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.rights.access | Open Access |
local.identifier.drac | 34046662 |
dc.description.version | Preprint |
local.citation.author | Roura, S.; Martinez, C. |