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

Baisakh; Rakesh Mohanty

Home/Archive/arXiv

arXiv · 2010.14752

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

Baisakh·Rakesh Mohanty

View original source ↗Read source document ↗Export metadata ↓

Abstract

The design and analysis of efficient algorithms with the knowledge of current and past inputs is a non-trivial and challenging research area in computer science. In many practical applications the future inputs are not available to the algorithm at any instance of time. So the algorithm has to make decisions based on a sequence of inputs that are in order and on the fly. Such algorithms are known as online algorithms. For measuring the performance of online algorithms, a standard measure, known as competitive analysis, has been extensively used in the literature. List update problem is a well studied research problem in the area of online algorithms since last few decades. One of the widely used deterministic online list update algorithm is the Move-To-Front (MTF) algorithm, which has been shown to be 2-competitive with best performance in practical real life inputs. In this paper we analyse the Move-to-Front-or-Middle (MFM) algorithm using competitive analysis by addressing one of an open question raised by Albers that whether dynamic offline algorithm can be used in finding the competitiveness of an online algorithm? Move-To-Front-or-Middle (MFM) was experimentally studied and observed to be performing better than MTF algorithm by using the Calgary Corpus and Canterbury Corpus data set. However, it is interesting and challenging to find the lower bound and upper bound on the competitive ratio of MFM algorithm. We make a first attempt to find the competitiveness of MFM algorithm. Our new results show that MFM is not 2-competitive with respect to static optimum offline algorithm, whereas it is 2-competitive with respect to dynamic optimum offline algorithm. Our new theoretical results may open up a new direction of research in the online list update problem by characterising the structure of competitive and non competitive deterministic online algorithms.

Explore related subjects

cs.DS cs.CC

Keep this discovery

BibTeX RIS

Baisakh, Rakesh Mohanty. 2020-10-26. Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm. https://arxiv.org/abs/2010.14752

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗