Iannis Tourlakis, Ph.D.
Affiliations: | 2006 | Princeton University, Princeton, NJ |
Area:
Uses of randomness in complexity theory and algorithms; Efficient algorithms for finding approximate solutions to NP-hard problems (or proving that they don't exist); Cryptography.Google:
"Iannis Tourlakis"Parents
Sign in to add mentor| Sanjeev Arora | grad student | 2006 | Princeton | |
| (New lower bounds for approximation algorithms in the Lovasz-Schrijver hierarchy.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Alekhnovich M, Arora S, Tourlakis I. (2011) Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy Computational Complexity. 20: 615-648 |
| Georgiou K, Magen A, Pitassi T, et al. (2010) Integrality gaps of 2 - o(1) for vertex cover SDPs in the Lov́asz-Schrijver hierarchy Siam Journal On Computing. 39: 3553-3570 |
| Georgiou K, Magen A, Pitassi T, et al. (2007) Integrality gaps of 2 - O(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 702-712 |
| Arora S, Bollobás B, Lovász L, et al. (2006) Proving Integrality Gaps without Knowing the Linear Program Theory of Computing. 2: 19-51 |