SIGACT News Online Algorithms Column 31-Reference-Cited by-同舟云学术

SIGACT News Online Algorithms Column 31

Published:2017-09-07 Issue:3 Volume:48 Page:68-82
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Ambühl Christoph¹

Affiliation:

1. Institute for Theoretical Computer Science, ETH Zürich, Switzerland

Abstract

The list update problem is a well studied online problem in the area of self-adjusting data structures. Understanding the o?ine version of this problem is crucial because of the role it plays in the competitive analysis of online list update algorithms. In this paper we settle a long-standing open problem by showing that the o?ine list update problem is NP-hard.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3138860.3138871

Reference14 articles.

1. Improved Randomized On-Line Algorithms for the List Update Problem

2. A combined BIT and TIMESTAMP algorithm for the list update problem

3. S. Albers and J. Westbrook . Self-organizing data structures. In A. Fiat and G. J. Woeginger editors Online Algorithms volume 1442 of Lecture Notes in Computer Science pages 13 -- 51 . Springer 1998 . S. Albers and J.Westbrook. Self-organizing data structures. In A. Fiat and G. J. Woeginger editors Online Algorithms volume 1442 of Lecture Notes in Computer Science pages 13-- 51. Springer 1998.

4. Optimal lower bounds for projective list update algorithms

5. A new lower bound for the list update problem in the partial cost model

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Itinerant List Update Problem;Approximation and Online Algorithms;2018