Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.
citing papers explorer
-
Distributed Stochastic Graph Algorithms
Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
-
Online Connectivity Augmentation
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.