arXiv (OAI Expanded)
open access
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Topics in Combinatorial Optimization#3267
- On Alon's problem concerning the difference between connected domination number and domination number#1077551
- Stronger Welch Bounds and Optimal Approximate $k$-Designs#1141487
- Managing Self-Learning Experts under Per-Round Budget Constraints#1129130
- Hull Games of Induced Path Convexities in Graphs#1104501
Record · ID 1084502
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive