Antibiotics Time Machine is NP-hard
classification
🧮 math.OC
math.DSq-bio.PE
keywords
problemantibioticantibioticsmachinenp-hardtimeaskedauthors
read the original abstract
The antibiotics time machine is an optimization question posed by Mira \latin{et al.} on the design of antibiotic treatment plans to minimize antibiotic resistance. The problem is a variation of the Markov decision process. These authors asked if the problem can be solved efficiently. In this paper, we show that this problem is NP-hard in general.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.