Approximating the least hypervolume contributor: NP-hard in general, but fast in practice

Karl Bringmann, Tobias Friedrich. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science, 425:104-116, 2012. [doi]

@article{BringmannF12-0,
  title = {Approximating the least hypervolume contributor: NP-hard in general, but fast in practice},
  author = {Karl Bringmann and Tobias Friedrich},
  year = {2012},
  doi = {10.1016/j.tcs.2010.09.026},
  url = {http://dx.doi.org/10.1016/j.tcs.2010.09.026},
  researchr = {https://researchr.org/publication/BringmannF12-0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {425},
  pages = {104-116},
}