pith. sign in

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm , booktitle =

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

fields

cs.DS 1 cs.GT 1

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Distributed Stochastic Graph Algorithms

cs.DS · 2026-05-20 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 2 of 2 citing papers.