Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Friedrich, Tobias Algorithms and Complexity, MPI for Informatics, Max Planck Society;
1-s2.0-S0304397510005050-main.pdf (Publisher version), 831KB
Bringmann, K., & Friedrich, T. (2012). Approximating the Least Hypervolume Contributor: NP-hard in General, But Fast in Practice. Theoretical computer science, 425, 104-116. doi:10.1016/j.tcs.2010.09.026.