Papers
Topics
Authors
Recent
Search
2000 character limit reached

Streaming Submodular Matching Meets the Primal-Dual Method

Published 23 Aug 2020 in cs.DS | (2008.10062v2)

Abstract: We study streaming submodular maximization subject to matching/bb-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. ∙\bullet 3+22≈5.8283+2\sqrt{2}\approx 5.828 for monotone MSM, improving the previous best ratio of $7.75$. ∙\bullet 4+32≈7.4644+3\sqrt{2}\approx 7.464 for non-monotone MSM, improving the previous best ratio of $9.899$. ∙\bullet 3+ϵ3+\epsilon for maximum weight b-matching, improving the previous best ratio of 4+ϵ4+\epsilon. On the lower bounds front, we improve on the previous best lower bound of ee−1≈1.582\frac{e}{e-1}\approx 1.582 for MSM, and show ETH-based lower bounds of ≈1.914\approx 1.914 for polytime monotone MSM streaming algorithms. Our most substantial contributions are our algorithmic techniques. We show that the (randomized) primal-dual method, which originated in the study of maximum weight matching (MWM), is also useful in the context of MSM. To our knowledge, this is the first use of primal-dual based analysis for streaming submodular optimization. We also show how to reinterpret previous algorithms for MSM in our framework; hence, we hope our work is a step towards unifying old and new techniques for streaming submodular maximization, and that it paves the way for further new results.

Authors (2)
Citations (26)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.