de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Approximating the Least Hypervolume Contributor: NP-hard in General, But Fast in Practice

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44447

Friedrich,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-BBDE-B
Abstract
There is no abstract available