A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2

Kortsarz, Guy, Nutov, Zeev · 2016 · DOI 10.1145/2786981

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-06-16 · unverdicted · novelty 6.0

Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.

Showing 1 of 1 citing paper.

Online Connectivity Augmentation cs.DS · 2026-06-16 · unverdicted · none · ref 35
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.