3 citations · 3 across the 4 of their papers we have counts for
5 papers
Incremental Maximization via Continuization
Yann Disser, Max Klimm, Kevin Schewior +1
We consider the problem of finding an incremental solution to a cardinality-constrained maximization problem that not only captures the solution for a fixed cardinality, but also d…
An Improved Algorithm for Open Online Dial-a-Ride
Julia Baligacs, Yann Disser, Nils Mosis +1
We consider the open online dial-a-ride problem, where transportation requests appear online in a metric space and need to be served by a single server. The objective is to minimiz…
Tight analysis of the lazy algorithm for open online dial-a-ride
Julia Baligacs, Yann Disser, Farehe Soheil +1
In the open online dial-a-ride problem, a single server has to deliver transportation requests appearing over time in some metric space, subject to minimizing the completion time.…
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
Yann Disser, Max Klimm, Annette Lutz +1
We consider the problem of maximizing a fractionally subadditive function under a knapsack constraint that grows over time. An incremental solution to this problem is given by an o…
Unified greedy approximability beyond submodular maximization
Yann Disser, David Weckbecker
We consider classes of objective functions of cardinality constrained maximization problems for which the greedy algorithm guarantees a constant approximation. We propose the new c…