Robust Independence Systems

DOI10.1137/120899480zbMath1290.68100OpenAlexW2016428812MaRDI QIDQ5891381

Naonori Kakimura, Kazuhisa Makino

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120899480

zbMATH Keywords

robustnessexchangeabilitymatroidsindependence systems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (8)

Randomized strategies for cardinality robustness in the knapsack problem ⋮ Randomized strategies for robust combinatorial optimization with approximate separation ⋮ Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows ⋮ Surrogate optimization for \(p\)-norms ⋮ Robust Independence Systems ⋮ Robust Randomized Matchings ⋮ Fractionally subadditive maximization under an incremental knapsack constraint ⋮ General bounds for incremental maximization

This page was built for publication: Robust Independence Systems