Corpus ID: 211097059

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

@article{Huang2020ApproximabilityOM,
  title={Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model},
  author={Chien-Chung Huang and Naonori Kakimura and Simon Mauras and Yuichi Yoshida},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.05477}
}
  • Chien-Chung Huang, Naonori Kakimura, +1 author Yuichi Yoshida
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • Maximizing a monotone submodular function under various constraints is a classical and intensively studied problem. However, in the single-pass streaming model, where the elements arrive one by one and an algorithm can store only a small fraction of input elements, there is much gap in our knowledge, even though several approximation algorithms have been proposed in the literature. In this work, we present the first lower bound on the approximation ratios for cardinality and matroid… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 41 REFERENCES

    Better Streaming Algorithms for the Maximum Coverage Problem

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Streaming Algorithms for Submodular Function Maximization

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Submodular Maximization Meets Streaming: Matchings, Matroids, and More

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL