Mads Anker Nielsen

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules

Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen +1

This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system $(E, I)$ , a schedule consists of an independent…

cs.DS2025

Non-Adaptive Evaluation of $k$ -of- $n$ Functions: Tight Gap and a Unit-Cost PTAS

Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior

We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of $k$ -of- $n$ functions: There are independent Boolean random variables $x_1,\dots,x_…

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules

Non-Adaptive Evaluation of k-of-n Functions: Tight Gap and a Unit-Cost PTAS

Non-Adaptive Evaluation of $k$ -of- $n$ Functions: Tight Gap and a Unit-Cost PTAS