NAPX: A Polynomial Time Approximation Scheme for the Noah s Ark Problem

Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh. NAPX: A Polynomial Time Approximation Scheme for the Noah s Ark Problem. In Keith A. Crandall, Jens Lagergren, editors, Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings. Volume 5251 of Lecture Notes in Computer Science, pages 76-86, Springer, 2008. [doi]

@inproceedings{HickeyCMZ08,
  title = {NAPX: A Polynomial Time Approximation Scheme for the Noah s Ark Problem},
  author = {Glenn Hickey and Paz Carmi and Anil Maheshwari and Norbert Zeh},
  year = {2008},
  doi = {10.1007/978-3-540-87361-7_7},
  url = {http://dx.doi.org/10.1007/978-3-540-87361-7_7},
  researchr = {https://researchr.org/publication/HickeyCMZ08},
  cites = {0},
  citedby = {0},
  pages = {76-86},
  booktitle = {Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings},
  editor = {Keith A. Crandall and Jens Lagergren},
  volume = {5251},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-87360-0},
}