Query efficient weighted stochastic matching

DOI10.4230/LIPICS.ICALP.2025.67MaRDI QIDQ7363148zbMATH OpenFDO

Authors Mahsa Derakhshan, Mohammad Saneian

Publication date 29 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.67

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• An Efron-Stein inequality for nonsymmetric statistics
• Beating greedy for stochastic bipartite matching
• Local computation: lower and upper bounds
• On sparsification of stochastic packing problems
• Stochastic matching on uniformly sparse graphs
• Stochastic matching with few queries: (1-ε) approximation
• Stochastic Matching with Few Queries: New Algorithms and Tools
• Stochastic packing integer programs with few queries
• Stochastic vertex cover with few queries
• Stochastic weighted matching: (1- ) approximation
• Towards a unified theory of sparsification for matching problems

This page was built for publication: Query efficient weighted stochastic matching

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