On Subset Selection with General Cost Constraints

@inproceedings{Qian2017OnSS,
  title={On Subset Selection with General Cost Constraints},
  author={Chao Qian and Jing-Cheng Shi and Yang Yu and Ke Tang},
  booktitle={IJCAI},
  year={2017}
}
  • Chao Qian, Jing-Cheng Shi, +1 author Ke Tang
  • Published in IJCAI 2017
  • Computer Science
  • This paper considers the subset selection problem with a monotone objective function and a monotone cost constraint, which relaxes the submodular property of previous studies. We first show that the approximation ratio of the generalized greedy algorithm is α2 (1 − 1 eα ) (where α is the submodularity ratio); and then propose POMC, an anytime randomized iterative approach that can utilize more time to find better solutions than the generalized greedy algorithm. We show that POMC can obtain the… 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.
    SHOWING 1-10 OF 13 CITATIONS

    Pareto Optimization for Subset Selection with Dynamic Cost Constraints

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Distributed Pareto Optimization for Subset Selection

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND

    An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover

    VIEW 1 EXCERPT
    CITES METHODS

    Online Active Perception for Partially Observable Markov Decision Processes with Limited Budget

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

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