atlas

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

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints

AAAI 2019 · 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
Use deterministic Greedy for submodular maximization with bounded curvature, without requiring monotonicityGreedy · Partition matroid constraints, submodular functionsapproximation ratio: \frac{1}{\alpha} ( 1 - e^{-\alpha \overline{d}/d})Helped
Use deterministic Greedy for monotone subadditive maximization with bounded curvatureGreedy · Partition matroid constraints, monotone subadditive functionsapproximation ratio: \frac{1}{\alpha} ( 1 - e^{(\alpha^2 -\alpha )\overline{d}/d})Helped
Apply deterministic Greedy to real-world directed-cut graphsGreedy · 20 Network Repository instances, unconstrained maximum directed cutsolution quality relative to optimumHelped

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