A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

Cohen, Nachshon, Nutov, Zeev · 2013 · DOI 10.1016/j.tcs.2013.04.004

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 47
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.