AI Paper Atlas

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

Randomized Strategies for Robust Combinatorial Optimization

Yasushi Kawase, Hanna Sumita

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 9 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 a polytope LP and retrieve a randomized strategy for linear objectivesRobust linear optimization · Matroid or matroid intersection constraintsapproximation ratio: PImproved
Use the dominant of the path polytope for the LP formulationRobust linear optimization · Shortest s–t pathapproximation ratio: PImproved
Relax the knapsack polytope and approximately retrieve a randomized strategyLP-based robust linear optimization · Knapsackapproximation ratio: PTASImproved
Use a relaxed intersection polytope with contention resolutionLP-based robust linear optimization · μ-matroid intersectionapproximation ratio: 2/(eμ)Improved
Apply MWU with capped reductions of monotone submodular objectivesRobust monotone submodular maximization · Matroid or knapsackapproximation ratio: 1-1/e-εImproved
Apply MWU with objective-function reductionsRobust monotone submodular maximization · μ-matroid intersectionapproximation ratio: 1/(μ+ε)Improved
Apply MWU with objective-function reductionsRobust linear maximization · μ-matroid intersectionapproximation ratio: 1/(μ-1+ε)Improved
Use reductions that preserve submodularity for non-monotone objectivesRobust submodular maximization · Unconstrainedapproximation ratio: 1/2-εImproved
Apply MWU with capped linear objective functionsRobust linear maximization · Knapsackapproximation ratio: FPTASImproved
Use an FPTAS for the reduced weighted subproblem within MWUMaximum cardinality robustness · Knapsackapproximation ratio: FPTASImproved
Randomize over feasible independent sets instead of choosing one deterministic setRobust optimization · Example with objectives favoring distinct singleton elementsworst-case value: 0 -> 1/2Improved
Use function reductions in MWU instead of updating directly with unscaled objective valuesMWU-based robust optimization · General nonnegative objectivesapproximation ratio: α-εImproved

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