research
∙
04/13/2020
A General Framework for Approximating Min Sum Ordering Problems
We consider a large family of problems in which an ordering of a finite ...
share
research
∙
01/20/2020
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
We consider single-machine scheduling problems that are natural generali...
research
∙
07/18/2019
Makespan Minimization with OR-Precedence Constraints
We consider a variant of the NP-hard problem of assigning jobs to machin...
research
∙
05/31/2019
