Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Connectivity Augmentation
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.