A Novel Move-To-Front-or-Logarithmic Position (MFLP) Online List Update Algorithm

10/25/2020
by   Baisakh, et al.
0

In this paper we propose a novel online deterministic list update algorithm known as Move-To-Front-or-Logarithmic Position (MFLP). Our proposed algorithm MFLP achieves a competitive ratio of 2 for larger list with respect to static optimum offline algorithm, whereas MFLP is not competitive for smaller list. We also show that MFLP is 2 competitive with respect to dynamic optimum offline algorithm. Our results open up a new direction of work towards classifying the online algorithms based on competitive and not competitive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2020

Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm

The design and analysis of efficient algorithms with the knowledge of cu...
research
06/30/2023

An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem

We study the online variant of the Min-Sum Set Cover (MSSC) problem, a g...
research
07/18/2018

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing

This work is a continuation of efforts to define and understand competit...
research
04/18/2021

Online List Access with Precedence Constraints

This paper considers a natural generalization of the online list access ...
research
09/11/2022

An Improved Algorithm For Online Reranking

We study a fundamental model of online preference aggregation, where an ...
research
05/14/2019

Online Computation with Untrusted Advice

The advice model of online computation captures the setting in which the...
research
06/20/2022

List Colouring Trees in Logarithmic Space

We show that List Colouring can be solved on n-vertex trees by a determi...

Please sign up or login with your details

Forgot password? Click here to reset