Pinwheel covering

DOI10.1007/978-3-031-92935-9_12MaRDI QIDQ6902112zbMATH OpenFDO

Authors Akitoshi Kawamura, Yusuke Kobayashi, Yosuke Kusano

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_12

zbMATH Keywords

densitypacking and coveringpinwheel scheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Erdős covering systems
• On a periodic maintenance problem
• On disjoint residue classes
• On exactly covering systems of arithmetic sequences
• Partial Sums of the Harmonic Series
• Perpetual maintenance of machines with different urgency requirements
• Schedulers for larger classes of pinwheel instances
• Simple strategies versus optimal schedules in multi-agent patrolling
• Windows Scheduling Problems for Broadcast Systems

Cited in

(2)

• Hardness and fixed parameter tractability for pinwheel scheduling problems
• Hardness and fixed parameter tractability for pinwheel scheduling problems

This page was built for publication: Pinwheel covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902112)