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

From MaRDI portal
Publication:418034

DOI10.1016/j.tcs.2010.09.026zbMath1237.68085OpenAlexW2029496228MaRDI QIDQ418034

Tobias Friedrich, Karl Bringmann

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.026




Related Items (9)


Uses Software


Cites Work


This page was built for publication: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice