2 papers
cs.DS2021
An Efficient Branch-and-Bound Solver for Hitting Set
Thomas Bläsius, Tobias Friedrich, David Stangl +1
The hitting set problem asks for a collection of sets over a universe to find a minimum subset of that intersects each of the given sets. It is NP-hard and equivalent to th…
cs.GT2019
Convergence and Hardness of Strategic Schelling Segregation
Hagen Echzell, Tobias Friedrich, Pascal Lenzner +5
The phenomenon of residential segregation was captured by Schelling's famous segregation model where two types of agents are placed on a grid and an agent is content with her locat…