Corpus ID: 221266214

Streaming Submodular Matching Meets the Primal-Dual Method

@article{Levin2020StreamingSM,
  title={Streaming Submodular Matching Meets the Primal-Dual Method},
  author={Roie Levin and David Wajc},
  journal={ArXiv},
  year={2020},
  volume={abs/2008.10062}
}
  • Roie Levin, David Wajc
  • Published 2020
  • Computer Science
  • ArXiv
  • We study streaming submodular maximization subject to matching/b-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. • 3 + 2 √ 2 ≈ 5.828 for monotone MSM, improving the previous best ratio of 7.75. • 4 + 3 √ 2 ≈ 7.464 for non-monotone MSM, improving the previous best ratio of 9.899. • 3 + ǫ for maximum weight b-matching, improving the previous best… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 68 REFERENCES
    Submodular Maximization Meets Streaming: Matchings, Matroids, and More
    • 64
    • Highly Influential
    • PDF
    Do Less, Get More: Streaming Submodular Maximization with Subsampling
    • 32
    • Highly Influential
    • PDF
    Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
    • 25
    • PDF
    Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
    • 135
    • PDF
    Submodular maximization by simulated annealing
    • 117
    • PDF
    Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
    • 8
    • PDF
    Non-monotone submodular maximization under matroid and knapsack constraints
    • 193
    • PDF
    Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching
    • 121
    • Highly Influential
    • PDF