← 研踪 PaperTrailarXiv:2611.20473 · v1
Online and Fully-Dynamic Sorting
首次提交 2026-11-16 11:37
版本更新 2026-11-16 11:37
雷达观测 2026-11-17 13:07
摘要
Online sorting asks how to place 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: for online sorting and 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 -competitive and has amortized recourse per update. We complement this with a lower bound showing that any deterministic algorithm with any competitive ratio has amortized recourse at least .(2) For the insertion-only setting, we establish a family of approximation--recourse tradeoffs, including competitive ratio with 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 space.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 11:37 · 最新观测版本
Online and Fully-Dynamic Sorting
Online sorting asks how to place 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: for online sorting and 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 -competitive and has amortized recourse per update. We complement this with a lower bound showing that any deterministic algorithm with any competitive ratio has amortized recourse at least .(2) For the insertion-only setting, we establish a family of approximation--recourse tradeoffs, including competitive ratio with 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 space.
查看此版本解读 →查看此版本原文 ↗