Streaming Submodular Matching Meets the Primal-Dual Method
Roie Levin, David Wajc

TL;DR
This paper advances the theoretical understanding of streaming submodular maximization under matching constraints by providing improved approximation algorithms and bounds using primal-dual methods, unifying and extending previous techniques.
Contribution
It introduces primal-dual algorithms for MSM with better approximation ratios and establishes new lower bounds, pioneering the use of primal-dual analysis in streaming submodular optimization.
Findings
Improved approximation ratios for monotone and non-monotone MSM.
New lower bounds for streaming MSM algorithms.
First application of primal-dual methods in streaming submodular maximization.
Abstract
We study streaming submodular maximization subject to matching/-matching constraints (MSM/MSbM), and present improved upper and lower bounds for these problems. On the upper bounds front, we give primal-dual algorithms achieving the following approximation ratios. for monotone MSM, improving the previous best ratio of . for non-monotone MSM, improving the previous best ratio of . for maximum weight b-matching, improving the previous best ratio of . On the lower bounds front, we improve on the previous best lower bound of for MSM, and show ETH-based lower bounds of for polytime monotone MSM streaming algorithms. Our most substantial contributions are our algorithmic techniques. We show that the (randomized)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
