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 J. Shi and K. Tang and Z. Zhou},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2018},
  volume={22},
  pages={595-608}
}
  • Chao Qian, J. Shi, +1 author Z. Zhou
  • Published 2018
  • Mathematics, Computer Science
  • IEEE Transactions on Evolutionary Computation
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… Expand
21 Citations
On Multiset Selection With Size Constraints
  • 9
  • PDF
Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences
  • PDF
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
  • Chao Qian
  • Computer Science, Medicine
  • Evolutionary Computation
  • 2019
  • 1
  • PDF
Streaming k-Submodular Maximization under Noise subject to Size Constraint
  • 3
  • Highly Influenced
  • PDF
Sequence Selection by Pareto Optimization
  • 2
  • PDF
Distributed Pareto Optimization for Large-Scale Noisy Subset Selection
  • Chao Qian
  • Computer Science
  • IEEE Transactions on Evolutionary Computation
  • 2020
  • 8
  • PDF
Error Analysis of Elitist Random Search Heuristics.
...
1
2
3
...

References

SHOWING 1-10 OF 38 REFERENCES
On Subset Selection with General Cost Constraints
  • 28
  • PDF
Monotone k-Submodular Function Maximization with Size Constraints
  • 28
  • PDF
Improved Approximation Algorithms for k-Submodular Function Maximization
  • 14
  • Highly Influential
  • PDF
On Greedy Maximization of Entropy
  • 36
  • PDF
On the approximation ability of evolutionary optimization with application to minimum set cover
  • 70
  • PDF
Towards Minimizing k-Submodular Functions
  • 53
  • PDF
Approximating covering problems by randomized search heuristics using multi-objective models
  • 91
  • PDF
Maximizing Bisubmodular and k-Submodular Functions
  • 14
  • PDF
Computing Minimum Cuts by Randomized Search Heuristics
  • 29
  • PDF
Lazier Than Lazy Greedy
  • 206
  • PDF
...
1
2
3
4
...