Show simple item record

dc.contributor.authorRoura Ferret, Salvador
dc.contributor.authorMartínez Parra, Conrado
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2022-07-22T11:42:49Z
dc.date.available2022-07-22T11:42:49Z
dc.date.issued1996-11-27
dc.identifier.citationRoura, S.; Martinez, C. New results about the list access problem. 1996.
dc.identifier.urihttp://hdl.handle.net/2117/370906
dc.description.abstractWe 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.extent9 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-96-63-R
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshAlgorithms
dc.titleNew results about the list access problem
dc.typeExternal research report
dc.subject.lemacAlgorismes
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac34046662
dc.description.versionPreprint
local.citation.authorRoura, S.; Martinez, C.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record