2 citations · 2 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
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…
cs.DS2020★ 2 cited
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…