An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover

Kobayashi, Yusuke, Noguchi, Takashi · 2023 · DOI 10.4230/lipics.isaac.2023.49

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