1 citations · 5 across the 11 of their papers we have counts for
16 papers
Finding Fair Draws for Incomplete Round Robin Tournaments
Sten Wessel, Frits Spieksma
In an incomplete round robin tournament, teams play against different sets of opponents. Given varying strengths of the teams, this raises a fairness issue. We establish the comple…
Fair Schedules for Single Round Robin Tournaments with Ranked Participants
Sten Wessel, Cor Hurkens, Frits Spieksma
We introduce a new measure to capture fairness of a schedule in a single round robin (SRR) tournament when participants are ranked by strength. To prevent distortion of the outcome…
Stable Approximation Algorithms for Dominating Set and Independent Set
Mark de Berg, Arpan Sadhukhan, Frits Spieksma
We study the Dominating set problem and Independent Set Problem for dynamic graphs in the vertex-arrival model. We say that a dynamic algorithm for one of these problems is -sta…
Scheduling jobs that change over time
Roel Lambers, Rudi Pendavingh, Frits Spieksma +1
We consider a 1-machine scheduling problem where the temperature of a job rises during processing, and cools down when not being processed according to given linear heating and coo…
Fairness in Graph-Theoretical Optimization Problems
Christopher Hojny, Frits Spieksma, Sten Wessel
There is arbitrariness in optimum solutions of graph-theoretic problems that can give rise to unfairness. Incorporating fairness in such problems, however, can be done in multiple…
Finding Diverse Minimum s-t Cuts
Mark de Berg, Andrés López Martínez, Frits Spieksma
Recently, many studies have been devoted to finding diverse solutions in classical combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et al., IS…
How to Design a Stable Serial Knockout Competition
Frits Spieksma, Rudi Pendavingh, Roel Lambers
We investigate a new tournament format that consists of a series of individual knockout tournaments; we call this new format a Serial Knockout Competition (SKC). This format has re…
Integer Programming Models for Round Robin Tournaments
Jasper van Doornmalen, Christopher Hojny, Roel Lambers +1
Round robin tournaments are omnipresent in sport competitions and beyond. We propose two new integer programming formulations for scheduling a round robin tournament, one of which…
Package Delivery Using Drones with Restricted Movement Areas
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
For the problem of delivering a package from a source node to a destination node in a graph using a set of drones, we study the setting where the movements of each drone are restri…
Rejection-proof Kidney Exchange Mechanisms
Danny Blom, Bart Smeulders, Frits C. R. Spieksma
Kidney exchange programs (KEPs) form an innovative approach to increasing the donor pool through allowing the participation of renal patients together with a willing but incompatib…
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
Mark de Berg, Arpan Sadhukhan, Frits Spieksma
Let be a set of points in , where each point has an associated transmission range . The range assignment induces a directed communication graph…
Filling a theatre in times of corona
Danny Blom, Rudi Pendavingh, Frits C. R. Spieksma
In this paper, we introduce an optimization problem posed by the Music Building Eindhoven (MBE) to deal with the economical consequences of the COVID-19 pandemic for theatre halls.…
The Stackelberg Kidney Exchange Problem is -complete
Bart Smeulders, Danny Blom, Frits C. R. Spieksma
We introduce the Stackelberg kidney exchange problem. In this problem, an agent (e.g. a hospital or a national organization) has control over a number of incompatible patient-donor…
Approximation algorithms for car-sharing problems
Kelin Luo, Frits C. R. Spieksma
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegati…
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
Annette M. C. Ficker, Thomas Erlebach, Matus Mihalak +1
Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum…
The interval ordering problem
Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma +2
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed inter…