AI Paper Atlas

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

Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Networks

Johan Bjorck, Yiwei Bai, Xiaojian Wu, Yexiang Xue, Mark Whitmore, Carla Gomes

AAAI 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
use width relaxation with randomized rounding instead of continuous relaxationSparse submodular optimization on HWA biocontrol networks · Randomly selected subsets of the HWA networksolution quality and scalabilityImproved
use the greedy algorithm instead of the proposed methodHWA biocontrol · Small network instancessolution qualityImproved
use the greedy algorithm instead of the proposed methodHWA biocontrol · Large network instancessolution qualityHurt
use the fast enumerative algorithm instead of the proposed methodSparse submodular optimization on HWA biocontrol networks · Randomly selected subsets of the HWA networksolution qualityHurt

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