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

Bringmann, Karl; Friedrich, Tobias

doi:10.1016/j.tcs.2010.09.026

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

MPS-Authors

/persons/resource/persons44182

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

/persons/resource/persons44447

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

1-s2.0-S0304397510005050-main.pdf
(Publisher version), 831KB

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: https://hdl.handle.net/11858/00-001M-0000-0014-BBDE-B

Abstract

There is no abstract available