Submitted final version of article “Hardness of Approximating Flow and Job Shop Scheduling Problems” to appear in Journal of the ACM (joint work with Monaldo Mastrolilli).
Worked on a revision of our paper “Approximating Linear Threshold Predicates” submitted to Transactions on Computation Theory (joint work with Mahdi Cheraghchi, Johan Hastad and Marcus Isaksson)
Helped organize and attended the workshop “Algebraic Coding Theory”, September 7-9 2011.
Attend a reading group consisting of the algo group where we try to understand how to use spatially coupled codes in order to increase the threshold where belief propagation works.
Started to work on the Single Source Rent or Buy problem with the discrete math group. This problem has many other famous problems as special cases, such as Steiner tree, finding a spanning tree with maximum number of leaves, etc. Our understanding of its approximability remains unsatisfying.
Served on the program committee of “The 18th Computing: the Australasian Theory Symposium (CATS) 2012.”