96 citations · 376 across the 69 of their papers we have counts for
5 papers · 1 filter
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
Vahid Roostapour, Aneta Neumann, Frank Neumann +1
We consider the subset selection problem for function with constraint bound that changes over time. Within the area of submodular optimization, various greedy approaches ar…
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
Tobias Friedrich, Andreas Göbel, Frank Neumann +2
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular…
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
Tobias Friedrich, Andreas Göbel, Francesco Quinzan +1
A core feature of evolutionary algorithms is their mutation operator. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform muta…
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich +3
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It h…
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
Thomas Bläsius, Tobias Friedrich, Julius Lischeid +2
The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polyn…