A greedy algorithm matches recent optimal size/hopbound tradeoffs for shortcut sets and receives a new existential optimality proof for matching hopsets up to logarithmic factors.
Shortcuts and transitive-closure spanners approximation.arXiv preprint arXiv:2502.08032,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greedy Algorithms for Shortcut Sets and Hopsets
A greedy algorithm matches recent optimal size/hopbound tradeoffs for shortcut sets and receives a new existential optimality proof for matching hopsets up to logarithmic factors.