6 citations · 11 across the 20 of their papers we have counts for
4 papers · 1 filter
Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs
Lukas Drexler, Jan Höckendorff, Joshua Könen +1
We consider the following natural problem that generalizes min-sum-radii clustering: Given is as well as some metric space where for facilities…
Trading Prophets
José Correa, Andrés Cristi, Paul Dütting +3
In this work we initiate the study of buy-and-sell prophet inequalities. We start by considering what is arguably the most fundamental setting. In this setting the online algorithm…
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…
Improved Approximation Algorithms for the Expanding Search Problem
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm +1
A searcher is tasked with exploring a graph with edge lengths and vertex weights, starting from a designated vertex. Initially, only the starting vertex is considered explored. At…