Research map / Learning theory and algorithms / Submodular and game algorithms
Randomized Strategies for Robust Combinatorial Optimization
Yasushi Kawase, Hanna Sumita
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use a polytope LP and retrieve a randomized strategy for linear objectives | Robust linear optimization · Matroid or matroid intersection constraints | approximation ratio: P | Improved |
| Use the dominant of the path polytope for the LP formulation | Robust linear optimization · Shortest s–t path | approximation ratio: P | Improved |
| Relax the knapsack polytope and approximately retrieve a randomized strategy | LP-based robust linear optimization · Knapsack | approximation ratio: PTAS | Improved |
| Use a relaxed intersection polytope with contention resolution | LP-based robust linear optimization · μ-matroid intersection | approximation ratio: 2/(eμ) | Improved |
| Apply MWU with capped reductions of monotone submodular objectives | Robust monotone submodular maximization · Matroid or knapsack | approximation ratio: 1-1/e-ε | Improved |
| Apply MWU with objective-function reductions | Robust monotone submodular maximization · μ-matroid intersection | approximation ratio: 1/(μ+ε) | Improved |
| Apply MWU with objective-function reductions | Robust linear maximization · μ-matroid intersection | approximation ratio: 1/(μ-1+ε) | Improved |
| Use reductions that preserve submodularity for non-monotone objectives | Robust submodular maximization · Unconstrained | approximation ratio: 1/2-ε | Improved |
| Apply MWU with capped linear objective functions | Robust linear maximization · Knapsack | approximation ratio: FPTAS | Improved |
| Use an FPTAS for the reduced weighted subproblem within MWU | Maximum cardinality robustness · Knapsack | approximation ratio: FPTAS | Improved |
| Randomize over feasible independent sets instead of choosing one deterministic set | Robust optimization · Example with objectives favoring distinct singleton elements | worst-case value: 0 -> 1/2 | Improved |
| Use function reductions in MWU instead of updating directly with unscaled objective values | MWU-based robust optimization · General nonnegative objectives | approximation ratio: α-ε | Improved |
Closest papers by meaning
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.88)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.88)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.86)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.85)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.85)
- Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More (ICML 2024 · similarity 0.85)
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.
