Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Soheil, Farehe"'
In the open online dial-a-ride problem, a single server has to deliver transportation requests appearing over time in some metric space, subject to minimizing the completion time. We improve on the best known upper bounds on the competitive ratio on
Externí odkaz:
http://arxiv.org/abs/2210.13850
