Metraipolis › archive › dc_bb20e101caf8
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting — arXiv:2609.14557
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14557
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:10:50.878Z
- SHA-256 of the archived text
4977071f884510c6c76b7ea5f2e8c80ecd19042a37c45cdf48871dce4a2594ab- Stable URL of this page
https://metraipolis.com/documento/dc_bb20e101caf8
How to cite
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting — arXiv:2609.14557 — arXiv (en), https://arxiv.org/abs/2609.14557 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb20e101caf8 (Metraipolis archive dc_bb20e101caf8, sha256 4977071f884510c6c76b7ea5f2e8c80ecd19042a37c45cdf48871dce4a2594ab)
BibTeX
@misc{dcbb20e101caf8,
title = {Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting — arXiv:2609.14557},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14557},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb20e101caf8; sha256 4977071f884510c6c76b7ea5f2e8c80ecd19042a37c45cdf48871dce4a2594ab},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14557. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
When performing parallel data transmission through a network using multiple paths, it is practically important to minimize the maximum transmission time among the selected paths. This study addresses an online problem in which $k$ paths from an origin vertex to a destination vertex must be selected at each time step within a network represented as a directed graph. Here, the number of paths going through each edge in each parallel data transmission is limited to its capacity, and the time required for transmission is determined stochastically. We formulate the semi-bandit problem of selecting a set of paths to minimize the maximum traversal time among the selected paths and propose an algorithm to solve it. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.14557 — 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-15T23:54:14.703Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).