Two-Connected Spanning Subgraphs with at Most frac\ 10\ \ 7\ \ OPT\ Edges

Heeger, Klaus, Vygen, Jens · 2017 · DOI 10.1137/16m1091587

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 after filters.

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