Stochastic matching with few queries: (1-ε) approximation

DOI10.1145/3357713.3384340OpenAlexW3013750003MaRDI QIDQ5144996

Soheil Behnezhad, Mahsa Derakhshan, Mohammad T. Hajiaghayi

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11880

zbMATH Keywords

stochastic optimizationapproximation algorithmssublinear algorithmsstochastic matching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Deterministic dynamic matching in worst-case update time ⋮ Stochastic minimum vertex cover in general graphs: a \(3/2\)-approximation ⋮ Stochastic Matching with Few Queries: New Algorithms and Tools ⋮ Output sensitive fault tolerant maximum matching

This page was built for publication: Stochastic matching with few queries: (1-ε) approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144996)