跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20473 · v1

Online and Fully-Dynamic Sorting

首次提交 2026-11-16 11:37
版本更新 2026-11-16 11:37
雷达观测 2026-11-17 13:07
arXiv ↗PDF ↗

摘要

Online sorting asks how to place nn sequentially arriving elements in an array to minimize the sum of absolute differences between consecutive elements. Fully-dynamic sorting further extends the problem to allow both element insertions and deletions. Without recourse, these problems face strong lower bounds on the competitive ratio: Ω(n)Ω(\sqrt{n}) for online sorting and Ω(n)Ω(n) for fully-dynamic sorting. In sharp contrast, we show that allowing only poly-logarithmic recourse yields at least exponential improvements in the competitive ratio for both problems:(1) Our main algorithmic result is a deterministic fully-dynamic sorting algorithm that is O(log⁡2n)O(\log^2 n)-competitive and has O(log⁡4n)O(\log^4 n) amortized recourse per update. We complement this with a lower bound showing that any deterministic algorithm with any O(polylog(n))O(\mathrm{polylog}(n)) competitive ratio has amortized recourse at least Ω(log⁡n)Ω(\sqrt{\log n}).(2) For the insertion-only setting, we establish a family of approximation--recourse tradeoffs, including O(log⁡log⁡n)O(\log\log n) competitive ratio with O(log⁡log⁡n)O(\log\log n) amortized recourse. Given the lower bound in the fully-dynamic case, this result shows that the insertion-only problem yields exponentially better bounds than the fully-dynamic one.(3) Finally, we show that the stronger approximation-recourse tradeoff for the insertion-only case extends to the fully-dynamic setting when the array has (1+ε)n(1+\varepsilon)n space.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 11:37 · 最新观测版本

Online and Fully-Dynamic Sorting

Online sorting asks how to place nn sequentially arriving elements in an array to minimize the sum of absolute differences between consecutive elements. Fully-dynamic sorting further extends the problem to allow both element insertions and deletions. Without recourse, these problems face strong lower bounds on the competitive ratio: Ω(n)Ω(\sqrt{n}) for online sorting and Ω(n)Ω(n) for fully-dynamic sorting. In sharp contrast, we show that allowing only poly-logarithmic recourse yields at least exponential improvements in the competitive ratio for both problems:(1) Our main algorithmic result is a deterministic fully-dynamic sorting algorithm that is O(log⁡2n)O(\log^2 n)-competitive and has O(log⁡4n)O(\log^4 n) amortized recourse per update. We complement this with a lower bound showing that any deterministic algorithm with any O(polylog(n))O(\mathrm{polylog}(n)) competitive ratio has amortized recourse at least Ω(log⁡n)Ω(\sqrt{\log n}).(2) For the insertion-only setting, we establish a family of approximation--recourse tradeoffs, including O(log⁡log⁡n)O(\log\log n) competitive ratio with O(log⁡log⁡n)O(\log\log n) amortized recourse. Given the lower bound in the fully-dynamic case, this result shows that the insertion-only problem yields exponentially better bounds than the fully-dynamic one.(3) Finally, we show that the stronger approximation-recourse tradeoff for the insertion-only case extends to the fully-dynamic setting when the array has (1+ε)n(1+\varepsilon)n space.

查看此版本解读 →查看此版本原文 ↗