research
∙
07/01/2023
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard
Let d be a positive integer. For a finite set X ⊆ℝ^d, we define its inte...
share
research
∙
01/30/2023
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
We consider non-clairvoyant scheduling with online precedence constraint...
research
∙
03/18/2022
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
We solve the Bin Packing problem in O^*(2^k) time, where k is the number...
research
∙
01/13/2022
Cardinality Constrained Scheduling in Online Models
Makespan minimization on parallel identical machines is a classical and ...
research
∙
11/15/2021
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises
An influential 1990 paper of Hochbaum and Shanthikumar made it common wi...
research
∙
11/12/2020
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
This paper considers parallel machine scheduling with incompatibilities ...
research
∙
10/19/2020
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
We consider ILPs, where each variable corresponds to an integral point w...
research
∙
08/29/2020
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
We consider fundamental algorithmic number theoretic problems and their ...
research
∙
07/06/2020
Solving Packing Problems with Few Small Items Using Rainbow Matchings
An important area of combinatorial optimization is the study of packing ...
research
∙
09/26/2019
Approximation Algorithms for Scheduling with Class Constraints
Assigning jobs onto identical machines with the objective to minimize th...
research
∙
11/02/2018
