4 papers
Greedy Vector Balancing
Wojciech Czerwiński, Daniel Dadush, Ekin Ergen +3
In online vector balancing, vectors arrive one by one from a given set and the goal is to assign signs in an online manner so as to m…
Online Makespan Scheduling under Scenarios
Ekin Ergen
We consider a natural extension of online makespan scheduling on identical parallel machines by introducing scenarios. A scenario is a subset of jobs, and the task of our problem i…
Total Completion Time Scheduling Under Scenarios
Thomas Bosman, Martijn van Ee, Ekin Ergen +4
Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study inte…
Topological Expressivity of ReLU Neural Networks
Ekin Ergen, Moritz Grillo
We study the expressivity of ReLU neural networks in the setting of a binary classification problem from a topological perspective. Recently, empirical studies showed that neural n…