Metraipolis › archive › dc_17a032d30437

Near-Linear Preprocessing for Range Weighted Longest Increasing Subsequence Queries — arXiv:2610.20983

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20983
License (as archived)
CC0-1.0
Archived
2026-10-16T10:40:18.825Z
SHA-256 of the archived text
c4fd7663fc21949cd7048353a52de63ae31541c9cc66db28564f4d8986e8f2d8
Stable URL of this page
https://metraipolis.com/documento/dc_17a032d30437

How to cite

Near-Linear Preprocessing for Range Weighted Longest Increasing Subsequence Queries — arXiv:2610.20983 — arXiv (en), https://arxiv.org/abs/2610.20983 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17a032d30437 (Metraipolis archive dc_17a032d30437, sha256 c4fd7663fc21949cd7048353a52de63ae31541c9cc66db28564f4d8986e8f2d8)
BibTeX
@misc{dc17a032d30437,
  title = {Near-Linear Preprocessing for Range Weighted Longest Increasing Subsequence Queries — arXiv:2610.20983},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20983},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17a032d30437; sha256 c4fd7663fc21949cd7048353a52de63ae31541c9cc66db28564f4d8986e8f2d8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20983. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a deterministic data structure for range weighted longest increasing subsequence (LIS) queries on $n$ values with positive weights. Preprocessing takes $O(n\log^2 n)$ time and space. Value queries take $O(\log n)$ time, and an optimal subsequence of $k$ elements can be reported in $O(k + \log n)$ time. This resolves an open question on truly subquadratic preprocessing with polylogarithmic query time. The key is a single-crossing property of envelopes for value-separated endpoint sets, enabling $O(\log n)$-time persistent merges. The bounds assume constant-time exact addition and comparison of weights.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.20983 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:53:17.665Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).