AI Paper Atlas

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

Submodular Maximization Through Barrier Functions

NeurIPS 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 3 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
Use barrier-function local search for constrained submodular maximizationAlgBarrier · Vertex cover on Facebook ego and EU Email exchange networksobjective valueHelped
Use barrier-function local search instead of the compared baselinesVideo summarization on VSUMM · Video summarizationutility: up to 50% moreHelped
Use the heuristic barrier variant that permits solutions with aggregate knapsack cost above 1AlgHeuristic · Yelp location summarizationobjective valueHelped
Use the heuristic barrier variant that permits solutions with aggregate knapsack cost above 1AlgHeuristic · Twitter text summarization with two knapsacksobjective valueHelped
Increase the number of knapsack constraints from one to twoCompared algorithms · Twitter text summarizationobjective valueHurt

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