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

	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk DocID: 1qorC - View Document
	Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki DocID: 1qjxp - 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
	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 DocID: 1pX17 - View Document
	ORANGE BOXES = CNF & PARADIM REU MANDATORY EVENTS DARK GREEN = MANDATORY CNF REU ACTIVITIES • R E U • C A L E N D A R • Sunday Monday DocID: 1pQTs - View Document