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

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1858498_6

DetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-BBDE-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-14A1-A

Genre: Journal Article

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

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bringmann, Karl¹, Author
Friedrich, Tobias¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2012

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.tcs.2010.09.026
BibTex Citekey: Bringmann2012d
Other: Local-ID: 2016E88472935692C1257B12003B2439-Bringmann2012d

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 425 Sequence Number: - Start / End Page: 104 - 116 Identifier: -