Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

First Page		Document Content
Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP		Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 1,14 MB Share Document on Facebook

	Form LR-ER Page 1 of 6 (RevMailing Address P.O. BoxRaleigh, NC DocID: 1xW0N - View Document
	NC DEPARTMENT OF THE SECRETARY OF STATE NORTH CAROLINA LOBBYING COMPLIANCE DIVISION COMPLAINT FORM Mail to: North Carolina Lobbying Compliance Division DocID: 1xVui - View Document
	Mailing Address P.O. BoxRaleigh, NC Liaison Expense Report Form – Zero Expense Short Form DocID: 1xVif - View Document
	Mailing Address P.O. BoxRaleigh, NC DocID: 1xV1x - View Document
	Mailing Address P.O. BoxRaleigh, NC DocID: 1xUOl - View Document