Online submodular maximization with free disposal: randomization beats \(\frac{1}{4}\) for partition matroids. (English) Zbl 1409.68339
Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1204-1223 (2017).
MSC:
| 68W27 | Online algorithms; streaming algorithms |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68W20 | Randomized algorithms |
| 68W25 | Approximation algorithms |
| 90C27 | Combinatorial optimization |
