Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee

@article{Qian2018ConstrainedM,
  title={Constrained Monotone  \$k\$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee},
  author={Chao Qian and Jing-Cheng Shi and Ke Tang and Zhi-Hua Zhou},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2018},
  volume={22},
  pages={595-608}
}
  • Chao Qian, Jing-Cheng Shi, +1 author Zhi-Hua Zhou
  • Published in
    IEEE Transactions on…
    2018
  • Mathematics, Computer Science
  • The problem of maximizing monotone ${k}$ -submodular functions under a size constraint arises in many applications, and it is NP-hard. In this paper, we propose a new approach which employs a multiobjective evolutionary algorithm to maximize the given objective and minimize the size simultaneously. For general cases, we prove that the proposed method can obtain the asymptotically tight approximation guarantee, which was also achieved by the greedy algorithm. Moreover, we further give instances… 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-7 OF 7 CITATIONS

    Quality Diversity Through Surprise

    VIEW 1 EXCERPT
    CITES METHODS

    Evolutionary Generative Adversarial Networks

    VIEW 1 EXCERPT
    CITES METHODS

    Sequence Selection by Pareto Optimization

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    References

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

    Maximizing Bisubmodular and k-Submodular Functions

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    On Greedy Maximization of Entropy

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Real-time object tracking via compressive feature selection

    VIEW 1 EXCERPT