1 citations · 1 across the 9 of their papers we have counts for
8 papers · 1 filter
When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
Max Klimm, Jannik Matuschke
Consider a finite ground set , a set of feasible solutions , and a class of objective functions defined on . We are interested in su…
Incremental-Decremental Maximization
Yann Disser, Max Klimm, Annette Lutz +1
We introduce a framework for incremental-decremental maximization that captures the gradual transformation or renewal of infrastructures. In our model, an initial solution is trans…
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…
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs
Per Joachims, Max Klimm, Philipp Warode
This paper studies a variant of the minimum-cost flow problem in a graph with convex cost function where the demands at the vertices are functions depending on a one-dimensional pa…
Travelling on Graphs with Small Highway Dimension
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] a…
Tight bounds for undirected graph exploration with pebbles and multiple agents
Yann Disser, Jan Hackfeld, Max Klimm
We study the problem of deterministically exploring an undirected and initially unknown graph with vertices either by a single agent equipped with a set of pebbles, or by a set…