Antibiotics Time Machine is NP-hard
Optimization and Control
2015-05-12 v1 Dynamical Systems
Populations and Evolution
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.
Cite
@article{arxiv.1505.02694,
title = {Antibiotics Time Machine is NP-hard},
author = {Ngoc Mai Tran and Jed Yang},
journal= {arXiv preprint arXiv:1505.02694},
year = {2015}
}
Comments
5 pages