atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 41 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace generalized greedy with EAMC (evolutionary algorithm on surrogate objective)subset selection with cost constraints · max coverage, influence maximization, sensor placementobjective value fHelped
replace POMC with EAMCsubset selection with cost constraints · influence maximization graph200 out-degreeobjective value fMixed
compare new solution only within same-size bins and keep two solutions per bin (EAMC) rather than a Pareto population (POMC) (ablation)EA for subset selection · influence maximization graph200 out-degreepopulation size: 70 -> 23Helped
use noisy objective evaluation (influence spread simulations) with EAMCEAMC · influence maximizationinfluence spread over timeHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy