Graph exploration with edge weight estimates is claimed to have optimal competitive ratio α in general and (1+α)/2 on complete graphs with uniform announced weights.
In: 31st Annual European Symposium on Algo rithms, ESA 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Graph Exploration with Edge Weight Estimates
Graph exploration with edge weight estimates is claimed to have optimal competitive ratio α in general and (1+α)/2 on complete graphs with uniform announced weights.