Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

First Page		Document Content
Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm		Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Download Document from Source Website File Size: 158,95 KB Share Document on Facebook

	Hardness of approximation for vertex-connectivity network design problems Guy Kortsarz∗ Robert Krauthgamer† DocID: 1uwF6 - View Document
	Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi Department of Computer Science Stanford University DocID: 1u068 - View Document
	We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit DocID: 1tRmH - View Document
	Hardness and Approximation of The Asynchronous Border Minimization Problem (Extended Abstract) Alexandru Popa1 , Prudence W.H. Wong2 , and Fencol C.C. Yung2 1 DocID: 1suK4 - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document