A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
From MaRDI portal
Publication:2060339
Recommendations
Cites work
- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- Approximation algorithms for replenishment problems with fixed turnover times
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Charlemagne's Challenge: The Periodic Latency Problem
- Complexity of inventory routing problems when routing is easy
- Cutting bamboo down to size
- Pinwheel scheduling: Achievable densities
- Schedulers for larger classes of pinwheel instances
Cited in
(7)- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- Cutting bamboo down to size
- Approximation algorithms for replenishment problems with fixed turnover times
- Perpetual maintenance of machines with different urgency requirements
- Perpetual scheduling with explorable uncertainty
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Hardness and fixed parameter tractability for pinwheel scheduling problems
This page was built for publication: A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060339)