Iannis Tourlakis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the tightening of the standard SDP for vertex cover with \(\ell_1\) inequalities	2012-10-24	Paper
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy Computational Complexity	2012-06-26	Paper
Proving integrality gaps without knowing the linear program Theory of Computing	2011-05-24	Paper
Integrality gaps of \(2-o(1)\) for vertex cover SDPs in the Lovász-Schrijver hierarchy SIAM Journal on Computing	2011-04-04	Paper
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy Proceedings of the thirty-seventh annual ACM symposium on Theory of computing	2010-08-16	Paper
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities Integer Programming and Combinatorial Optimization	2008-06-10	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science	2006-07-07	Paper
Time-space tradeoffs for SAT on nonuniform machines Journal of Computer and System Sciences	2002-02-19	Paper

Research outcomes over time

This page was built for person: Iannis Tourlakis