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.
Cliff Liu and Robert E
2 Pith papers cite this work, alongside 8 external citations. Polarity classification is still indexing.
2
Pith papers citing it
8
external citations · OpenAlex
fields
cs.DS 2years
2026 2representative citing papers
The ALT auction algorithm for bipartite matching works without freezing, admits an augmenting-path analysis, and requires Θ(1/ε²) iterations even on paths.
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.
-
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance
The ALT auction algorithm for bipartite matching works without freezing, admits an augmenting-path analysis, and requires Θ(1/ε²) iterations even on paths.