3 papers
cs.DS2025
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
Mateusz Basiak, Marcin Bienkowski, Martin Böhm +4
We consider the List Update problem where the cost of each swap is assumed to be 1. This is in contrast to the ``standard'' model, in which an algorithm is allowed to swap the requ…
cs.DS2025
Classification via Two-Way Comparisons
Marek Chrobak, Neal E. Young
Given a weighted, ordered query set and a partition of into classes, we study the problem of computing a minimum-cost decision tree that, given any query in , uses e…
cs.DS2024
Online Paging with Heterogeneous Cache Slots
Marek Chrobak, Samuel Haney, Mehraneh Liaee +4
It is natural to generalize the online -Server problem by allowing each request to specify not only a point , but also a subset of servers that may serve it. For uniform…