Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
From MaRDI portal
Publication:4962207
DOI10.1145/2746226zbMath1398.68689arXiv1012.4962OpenAlexW1526404960MaRDI QIDQ4962207
Anupam Gupta, R. Ravi, Viswanath Nagarajan
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.4962
Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (9)
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization ⋮ A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Universal Algorithms for Clustering Problems ⋮ Constrained submodular maximization via greedy local search ⋮ On the power of static assignment policies for robust facility location problems ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ On the Optimality of Affine Policies for Budgeted Uncertainty Sets
This page was built for publication: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
