2 citations · 2 across the 4 of their papers we have counts for
6 papers
An Algorithm for the Separation-Preserving Transition of Clusterings
Steffen Borgwardt, Felix Happach, Stetson Zirkelbach
The separability of clusters is one of the most desired properties in clustering. There is a wide range of settings in which different clusterings of the same data set appear. We a…
A General Framework for Approximating Min Sum Ordering Problems
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This fam…
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Felix Happach, Andreas S. Schulz
We consider single-machine scheduling problems that are natural generalizations or variations of the min-sum set cover problem and the min-sum vertex cover problem. For each of the…
Makespan Minimization with OR-Precedence Constraints
Felix Happach
We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial o…
Budget Minimization with Precedence Constraints
Marinus Gottschau, Felix Happach, Marcus Kaiser +1
Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs . A job is available f…
Good Clusterings Have Large Volume
S. Borgwardt, F. Happach
The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad th…