1 citations · 1 across the 9 of their papers we have counts for
9 papers
Stochastic scheduling with Bernoulli-type jobs through policy stratification
Antonios Antoniadis, Ruben Hoeksma, Kevin Schewior +1
This paper addresses the problem of computing a scheduling policy that minimizes the total expected completion time of a set of jobs with stochastic processing times on par…
Stochastic Minimum Spanning Trees with a Single Sample
Ruben Hoeksma, Gavin Speek, Marc Uetz
We consider the minimum spanning tree problem in a setting where the edge weights are stochastic from unknown distributions, and the only available information is a single sample o…
Product Portfolio Management in Competitive Environments
Samira Hossein Ghorban, Bardyaa Hesaam
Product diversity is one of the prominent factors for customers' satisfaction, while from the firms' perspective, the additional engineering costs required for product diversity sh…
Online Search for a Hyperplane in High-Dimensional Euclidean Space
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak +1
We consider the online search problem in which a server starting at the origin of a -dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competiti…
A better lower bound for Lower-Left Anchored Rectangle Packing
Ruben Hoeksma, Matthew Maat
Given any set of points in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in , exist, such that each of them has a point…
Speed-Robust Scheduling -- Sand, Bricks, and Rocks
Franziska Eberle, Ruben Hoeksma, Nicole Megow +3
The speed-robust scheduling problem is a two-stage problem where given machines, jobs must be grouped into at most bags while the processing speeds of the given machine…
On Hop-Constrained Steiner Trees in Tree-Like Metrics
Martin Böhm, Ruben Hoeksma, Nicole Megow +2
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most . Our main result is an exact algor…
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma +1
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that vi…
Approximability of Connected Factors
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey +2
Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal…