Author:
Bian Chao,Feng Chao,Qian Chao,Yu Yang
Abstract
In this paper, we study the problem of selecting a subset from a ground set to maximize a monotone objective function f such that a monotone cost function c is bounded by an upper limit. State-of-the-art algorithms include the generalized greedy algorithm and POMC. The former is an efficient fixed time algorithm, but the performance is limited by the greedy nature. The latter is an anytime algorithm that can find better subsets using more time, but without any polynomial-time approximation guarantee. In this paper, we propose a new anytime algorithm EAMC, which employs a simple evolutionary algorithm to optimize a surrogate objective integrating f and c. We prove that EAMC achieves the best known approximation guarantee in polynomial expected running time. Experimental results on the applications of maximum coverage, influence maximization and sensor placement show the excellent performance of EAMC.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search;Autonomous Robots;2024-01
2. A Gentle Introduction to Theory (for Non-Theoreticians);Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15
3. Data-Driven Similarity-based Worker Recruitment Towards Multi-task Data Inference for Sparse Mobile Crowdsensing;2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS);2023-06-19
4. A gentle introduction to theory (for non-theoreticians);Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09
5. Evolutionary submodular optimisation;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09