conftrace_

centroid-based decomposition

1 paper

Explore in graph

Co-occurring keywords · papers mentioning both

online shortest path (1) directed acyclic graph (1) adaptive adversary (1) regret bound (1) bandit feedback (1)

Papers

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025