A Sublogarithmic Competitive Algorithm for Online Graph Exploration
cs.DS
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- A lower bound of 4 for online graph exploration
- Randomization Helps in Online Graph Exploration: Breaking the Deterministic Lower Bound on Cycles
- Graph Exploration with Edge Weight Estimates
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time