Metraipolis › archive › dc_d49b708e513d

Approximating Submodular Orienteering via Rooted Subgraph Decomposition — arXiv:2611.03212

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03212
License (as archived)
CC0-1.0
Archived
2026-11-03T18:59:02.768Z
SHA-256 of the archived text
23f8f1f594c75c7f3160e53e269ae89f5274070cdcf1b2b0abdf0f3afef74d87
Stable URL of this page
https://metraipolis.com/documento/dc_d49b708e513d

How to cite

Approximating Submodular Orienteering via Rooted Subgraph Decomposition — arXiv:2611.03212 — arXiv (en), https://arxiv.org/abs/2611.03212 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d49b708e513d (Metraipolis archive dc_d49b708e513d, sha256 23f8f1f594c75c7f3160e53e269ae89f5274070cdcf1b2b0abdf0f3afef74d87)
BibTeX
@misc{dcd49b708e513d,
  title = {Approximating Submodular Orienteering via Rooted Subgraph Decomposition — arXiv:2611.03212},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03212},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d49b708e513d; sha256 23f8f1f594c75c7f3160e53e269ae89f5274070cdcf1b2b0abdf0f3afef74d87},
  year = {2026}
}

Archived text

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

The Submodular Orienteering problem asks for an $s$-$t$ walk in a directed graph that maximizes a monotone submodular function over the visited vertices subject to a bound on its length. We give a deterministic polynomial-time approximation algorithm with subpolynomial approximation rate $2^{O(\sqrt{\log n\,\log\log n})}$. This improves over the $O(n^\varepsilon)$ approximation rate that was previously known for every fixed $\varepsilon>0$. We prove a decomposition lemma that partitions a directed graph into rooted subgraphs such that every path intersects only polylogarithmically many such subgraphs. Our algorithm uses this decomposition to construct its recursive subproblems.

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/2611.03212 — 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-11-03T18:18:07.750Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).