Corpus ID: 19251434

On Multiset Selection With Size Constraints

@inproceedings{Qian2018OnMS,
  title={On Multiset Selection With Size Constraints},
  author={Chao Qian and Yibo Zhang and Ke Tang and Xin Yao},
  booktitle={AAAI},
  year={2018}
}
  • Chao Qian, Yibo Zhang, +1 author Xin Yao
  • Published in AAAI 2018
  • Computer Science
  • This paper considers the multiset selection problem with size constraints, which arises in many real-world applications such as budget allocation. Previous studies required the objective function f to be submodular, while we relax this assumption by introducing the notion of the submodularity ratios (denoted by αf and βf ). We propose an anytime randomized iterative approach POMS, which maximizes the given objective f and minimizes the multiset size simultaneously. We prove that POMS using a… CONTINUE READING

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

    Citations

    Publications citing this paper.

    References

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

    Maximizing Monotone Submodular Functions over the Integer Lattice

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Non-monotone DRsubmodular function maximization

    • T. Soma, Y. Yoshida
    • AAAI’17, 898–904.
    • 2017
    VIEW 1 EXCERPT