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)
-
Model-free assortment pricing with transaction data
Chen, Ningyuan, (2023)
- More ...
-
Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
Anari, Nima, (2020)
-
Online primal-dual algorithms for covering and packing
Buchbinder, Niv, (2009)
-
Budget feasible procurement auctions
Anari, Nima, (2018)
- More ...