David Weckbecker

Orcid: 0000-0003-3381-058X

According to our database1, David Weckbecker authored at least 8 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Unified Greedy Approximability beyond Submodular Maximization.
SIAM J. Discret. Math., March, 2024

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows.
SIAM J. Discret. Math., March, 2024

Competitive Analysis for Incremental Maximization
PhD thesis, 2024

2023
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Incremental Maximization via Continuization.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Tight analysis of lazy: an improved algorithm for open online dial-a-ride.
CoRR, 2022

An Improved Algorithm for Open Online Dial-a-Ride.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2021
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021


  Loading...