Skip to content

Author

Sander Borst

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling

We study interval scheduling from the perspective of fair allocation. There are $m$ identical machines and a set of intervals, each specified by a start time, an end time, and a nonnegative weight. A schedule assigns a subset of the intervals to the machines so that no two intervals on the same machine overlap, and the...

Sander Borst, Golnoosh Shahkarami, Rohit Vaish · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.