Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows Y Disser, M Klimm, A Lutz, D Weckbecker SIAM Journal on Discrete Mathematics 38 (1), 764-789, 2024 | 5 | 2024 |
Unified greedy approximability beyond submodular maximization Y Disser, D Weckbecker SIAM Journal on Discrete Mathematics 38 (1), 348-379, 2024 | 3 | 2024 |
An improved algorithm for open online dial-a-ride J Baligács, Y Disser, N Mosis, D Weckbecker International Workshop on Approximation and Online Algorithms, 154-171, 2022 | 3 | 2022 |
Incremental maximization via continuization Y Disser, M Klimm, K Schewior, D Weckbecker arXiv preprint arXiv:2305.01310, 2023 | 2 | 2023 |
Competitive Analysis for Incremental Maximization DM Weckbecker Technische Universität Darmstadt, 2024 | | 2024 |
Tight analysis of the lazy algorithm for open online dial-a-ride J Baligács, Y Disser, F Soheil, D Weckbecker Algorithms and Data Structures Symposium, 43-64, 2023 | | 2023 |
FRACTIONALLY SUBADDITIVE MAXIMIZATION UNDER AN INCREMENTAL KNAPSACK CONSTRAINT WITH APPLICATIONS TO INCREMENTAL FLOWS Y DISSER, MAX KLIMM, A LUTZ, D WECKBECKER | | |