Antibiotics Time Machine is NP-hard
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,...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| DOI: | 10.48550/arxiv.1505.02694 |