The pinwheel problem is NP-hard, implying hardness for related problems like bamboo garden trimming, and admits a PTAS that improves on the prior 9/7 approximation factor.
InAlgorithms and Complexity, IreneFinocchiandLoukasGeorgiadis(Eds.).SpringerNatureSwitzerland, Cham, 185–199
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
NP-Hardness and a PTAS for the Pinwheel Problem
The pinwheel problem is NP-hard, implying hardness for related problems like bamboo garden trimming, and admits a PTAS that improves on the prior 9/7 approximation factor.