collaborators

1 paper

cs.DM2025

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering

Akitoshi Kawamura, Yusuke Kobayashi

In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent can perform the task at most once in any $a_…