Portal de Periódicos da CAPES

Length-Weighted Disjoint Path Allocation

2018; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-319-98355-4_14

1611-3349

Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner,

Advanced Bandit Algorithms Research

We modify one of the foundational online problems, Disjoint Path Allocation, to include weighted requests. We provide a comprehensive competitive analysis, incorporating the viewpoints of both advice complexity and parametrized complexity. Our bounds feature a consistent parametrization and closely trace the trade-off between advice complexity and competitiveness.