Structured robust submodular maximization : offline and online algorithms
| Year of publication: |
2021
|
|---|---|
| Authors: | Torrico, Alfredo ; Singh, Mohit ; Pokutta, Sebastian ; Haghtalab, Nika ; Naor, Joseph Seffi ; Anari, Nima |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 4, p. 1590-1607
|
| Subject: | greedy algorithm | matroid constraints | online learning | robust optimization | submodular optimization | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Robustes Verfahren | Robust statistics | E-Learning | E-learning |
-
Oracle-based robust optimization via online learning
Ben-Tal, Aharon, (2015)
-
Efficient online linear optimization with approximation algorithms
Garber, Dan, (2021)
-
Modeling defender-attacker problems as robust linear programs with mixed-integer uncertainty sets
Borrero, Juan S., (2021)
- More ...
-
Integrality gap of the vertex cover linear programming relaxation
Singh, Mohit, (2019)
-
Robust online selection with uncertain offer acceptance
Perez-Salazar, Sebastian, (2025)
-
Proportional volume sampling and approximation algorithms for a-optimal design
Nikolov, Aleksandar, (2022)
- More ...