Abstract
The Next Release Problem (nrp) is an important problem in Software Engineering. Several papers investigate the nrp, most of them considering heuristics to solve the problem. However, the literature lacks a more theoretical approach to this problem, specially regarding its complexity, approximability and more powerful exact algorithms. In this paper we aim to help filling this gap.
Author supplied keywords
Cite
CITATION STYLE
Almeida, J. C., Pereira, F. de C., Reis, M. V. A., & Piva, B. (2018). The next release problem: Complexity, exact algorithms and computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10856 LNCS, pp. 26–38). Springer Verlag. https://doi.org/10.1007/978-3-319-96151-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
