arXiv 1306.02072013-06-02cs.DS

In pursuit of the dynamic optimality conjecture

John Iacono

备注：: Preliminary version of paper to appear in the Conference on Space Efficient Data Structures, Streams and Algorithms to be held in August 2013 in honor of Ian Munro's 66th birthday

英文摘要：

In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence---any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we survey the progress that has been made in the almost thirty years since the conjecture was first formulated, and present a binary search tree algorithm that is dynamically optimal if any binary search tree algorithm is dynamically optimal.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Settling the relationship between Wilber's bounds for dynamic optimality

In FOCS 1986, Wilber proposed two combinatorial lower bounds on the operational cost of any binary search tree (BST) for a given access sequence $X \in [n]^m$. Both bounds play a central role in the ongoing pursuit of the dynamic optimality conjecture (Sleator and Tarjan, 1985), but their relationship remained unknown for more than three decades. We show that Wilber's Funnel bound dominates his Alternation bound for all $X$, and give a tight $Θ(\lg\lg n)$ separation for some $X$, answering Wilber's conjecture and an open problem of Iacono, Demaine et. al. The main ingredient of the proof is a …

2020-06-28cs.DS

On Dynamic Optimality for Binary Search Trees

Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed independently by Lucas and Munro, and they conjectured it to be O(1)-competitive. Recently, Demaine et al. gave a geometric view of the BST problem. This view allowed them to give an online algorithm GreedyArb with the same cost as GreedyFuture. However, no o(n)-competitive ratio was known for GreedyArb. In this paper we make progress towards proving O(1)-competitive ratio for GreedyArb by showing that it is O(\log n)-c…

2011-02-22cs.DS

A Study on Splay Trees

We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.

2020-04-07cs.DS

Pattern-avoiding access in binary search trees

The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..] Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST.…

2015-07-24cs.DSmath.CO

A Foundation for Proving Splay is Dynamically Optimal

Consider the task of performing a sequence of searches in a binary search tree. After each search, we allow an algorithm to arbitrarily restructure the tree. The cost of executing the task is the sum of the time spent searching and the time spent optimizing the searches with restructuring operations. Sleator and Tarjan introduced this notion in 1985, along with an algorithm and a conjecture. The algorithm, Splay, is an elegant procedure for performing adjustments that move searched items to the top of the tree. The conjecture, called dynamic optimality, is that the cost of splaying is always w…

2022-05-09cs.DS

Robust Shortest Path Planning and Semicontractive Dynamic Programming

In this paper we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit-evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and unique…

2016-08-03cs.DSmath.OC

更多相关论文收起更多论文

关于检测碰撞与子图的实例最优性

On the instance optimality of detecting collisions and subgraphs

本文研究图与函数中子结构检测问题的无标签实例最优性，揭示出三分法：少数简单性质具有常数级实例最优算法，大多数性质距离实例最优性有 n 的多项式因子，而碰撞检测和寻找爪形子图处于中间地带，并证明其距离实例最优性为 Ω(log n) 且猜想该界是紧的。

2024-08-02cs.CCcs.CRcs.DS

渐近秩猜想下的快速确定性色数算法

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

该研究借助渐近秩猜想与三向划分的联系，构造出 O(1.99982^n) 的确定性图色数算法，并建立了色数下界与证伪该猜想之间的逆向关系。

2024-12-06cs.DS

The landscape of bounds for binary search trees

Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...) In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properties…

2016-03-15cs.DS

半轴上动态首次适应装箱的渐近最优性

Asymptotic optimality of dynamic first-fit packing on the half-axis

Imperial College London（帝国理工学院）；University of Illinois at Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）

本文研究了动态存储分配中的经典问题，证明了在非退化的物品尺寸分布下，首次适应算法在物品到达速率趋于无穷时的渐近最优性，即稳态下空隙空间与占用空间的比值趋于零。

2026-09-25cs.DSmath.PR

基于模式避免输入的优化

Optimization with pattern-avoiding input

本文研究了模式避免输入对优化问题复杂性的影响，证明了在动态最优猜想下的最优二叉搜索树的平均搜索成本为常数，并展示了该结论在其他算法问题中的广泛应用。

2025-11-24cs.DSmath.CO

Binary search trees and rectangulations

We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution trace of a BST that serves a sequence of queries is in close correspondence with the flip-sequence between two rectangulations. (Rectangulations are well-studied combinatorial objects also known as mosaic floorplans.) We also reinterpret Small Manhattan Network, a problem with known connections to the BST problem, in terms of flips in rectangulations. We apply f…

2016-03-26cs.CGcs.DSmath.CO