No. Title Author Year
1 General Knapsack Problems in a Dynamic Setting Fairstein, Yaron et al. 2021
2 A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem Fairstein, Yaron et al. 2020
3 Tight Bounds for Online Weighted Tree Augmentation Naor, Joseph (Seffi) et al. 2019
4 Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification Chen, Shahar et al. 2017
5 Online Semidefinite Programming Elad, Noa et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI