Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
arXiv:2609.14557v1 Announce Type: new Abstract: When performing parallel data transmission through a network using multiple paths, it is practically important to minimize the maximum transmission time