| No. | Title | Author | Year |
|---|---|---|---|
| 1 | An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding | Doron-Arad, Ilan et al. | 2023 |
| 2 | An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets | Doron-Arad, Ilan et al. | 2023 |
| 3 | Computing Generalized Convolutions Faster Than Brute Force | Esmer, Barış Can et al. | 2022 |
| 4 | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search | Esmer, Barış Can et al. | 2022 |
| 5 | General Knapsack Problems in a Dynamic Setting | Fairstein, Yaron et al. | 2021 |
| 6 | Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping | Fairstein, Yaron et al. | 2021 |
| 7 | A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | Fairstein, Yaron et al. | 2020 |
| 8 | Generalized Assignment via Submodular Optimization with Reserved Capacity | Kulik, Ariel et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |