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

	On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MIT DocID: 1unrQ - View Document
	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer DocID: 1rrUb - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document
	On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira DocID: 1q81r - View Document
	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 DocID: 1q2Qr - View Document