Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
Authors:
- Chao QianCQChao Qian
- Yang YuYYYang Yu
- Ke TangKTKe Tang
- Xin YaoXYXin Yao
- Zhi-Hua ZhouZZZhi-Hua Zhou
- 1 October 2019
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 275, 279-294
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China
- Shenzhen Peacock Plan
This publication has 25 references indexed in Scilit:
- Determinantal Point Processes for Machine LearningFoundations and Trends in Machine Learning, 2012
- Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective ModelsEvolutionary Computation, 2010
- Computing Minimum Cuts by Randomized Search HeuristicsAlgorithmica, 2009
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problemTheoretical Computer Science, 2007
- What's AI done for me lately? Genetic programming's human-competitive resultsIEEE Intelligent Systems, 2003
- Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitnessIEEE Transactions on Evolutionary Computation, 2001
- Some optimal inapproximability resultsJournal of the ACM, 2001
- Drift analysis and average time complexity of evolutionary algorithmsArtificial Intelligence, 2001
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Maximum entropy samplingJournal of Applied Statistics, 1987