No. Title Author Year
1 Computing Generalized Convolutions Faster Than Brute Force Esmer, Barış Can et al. 2022
2 Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search Esmer, Barış Can et al. 2022
3 General Knapsack Problems in a Dynamic Setting Fairstein, Yaron et al. 2021
4 Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping Fairstein, Yaron et al. 2021
5 A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem Fairstein, Yaron et al. 2020
6 Generalized Assignment via Submodular Optimization with Reserved Capacity Kulik, Ariel et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 6

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