Slide 1 Approximating complete partitions Guy Kortsarz Joint work with J. Radhakrishnan and S.Sivasubramanian Slide 2 Problem Definitions A disjoint partition of the vertices…

Slide 1 Positive Influence Dominating Set and Beyond My T. Thai @ UF Slide 2 Spread of Influence  Online Social Networks (OSNs) have been exploited as a platform for spreading…

Slide 1 A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann Institute of…

Slide 1 Approximation Algorithms for Graph Routing Problems Julia Chuzhoy Toyota Technological Institute at Chicago Slide 2 Routing Problems Input: Graph G, source-sink pairs…

Introduction to Coding Theory Lecture Notes∗ Yehuda Lindell Department of Computer Science Bar-Ilan University, Israel January 25, 2010 Abstract These are lecture notes…

Slide 1 Simons Institute for the Theory of Computing Bears 2013 February 14, 2013 Simons Institute for the Theory of Computing Funded by the Simons Foundation Selected in…

Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments Ananth I. Sundararaj, Manan Sanghi, John R. Lange and Peter A. Dinda {ais,manan,jarusl,pdinda}@cs.northwestern.edu…

Perturbative gadgets with constant-bounded interactions Sergey Bravyi1 David DiVincenzo1 Daniel Loss2 Barbara Terhal1 Classical and Quantum Information Theory Santa Fe, March…

The Matroid Median Problem Viswanath Nagarajan IBM Research Joint with R. Krishnaswamy, A. Kumar, Y. Sabharwal, B. Saha k-Median Problem Set of locations in a metric space…

HARDNESS OF APPROXIMATIONS Gap Introducing Reduction For simplicity we assume that we are always reducing from SAT(or any other NP- hard problem). Let Π be a minimization…