David Weckbecker

15 papers A* 1A 1B 3C 1Journal 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.
SIAM J. Discret. Math.
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2025 A conf
Incremental Maximization for a Broad Class of Objectives.
ESA
Yann Disser, David Weckbecker
2024 — —
Competitive Analysis for Incremental Maximization
David Weckbecker
2024 J jnl
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows.
SIAM J. Discret. Math.
Yann Disser, Max Klimm, Annette Lutz, David Weckbecker
2024 J jnl
Unified Greedy Approximability beyond Submodular Maximization.
SIAM J. Discret. Math.
Yann Disser, David Weckbecker
2023 A* conf
Incremental Maximization via Continuization.
ICALP
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023 J jnl
Incremental Maximization via Continuization.
CoRR
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023 B conf
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.
WADS
Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker
2022 B conf
An Improved Algorithm for Open Online Dial-a-Ride.
WAOA
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2022 J jnl
An Improved Algorithm for Open Online Dial-a-Ride.
CoRR
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2022 J jnl
Tight analysis of lazy: an improved algorithm for open online dial-a-ride.
CoRR
Júlia Baligács, Yann Disser, David Weckbecker
2022 C conf
Unified Greedy Approximability Beyond Submodular Maximization.
ISCO
Yann Disser, David Weckbecker
2021 B conf
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.
WAOA
Yann Disser, Max Klimm, David Weckbecker
2021 J jnl
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint.
CoRR
Yann Disser, Max Klimm, David Weckbecker
2020 J jnl
Unified greedy approximability beyond submodular maximization.
CoRR
Yann Disser, David Weckbecker