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

Bringmann, Karl; Friedrich, Tobias

doi:10.1007/978-3-642-01020-0_6

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

https://rdcu.be/dx1Qs
(Publisher version)

Fulltext (restricted access)

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

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., & Friedrich, T. (2009). Approximating the Least Hypervolume Contributor: NP-hard in General, but Fast in Practice. In M. Ehrgott, C. M. Fonseca, X. Gandibleux, J.-K. Hao, & M. Sevaux (Eds.), Evolutionary Multi-Criterion Optimization (pp. 6-20). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1807-E

Abstract

There is no abstract available