ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Inapproximability of Combinatorial Problems via Small LPs and SDPs
Article URLs:
Alternative Article URLs:
Authors: Gábor Braun
  • Georgia Institute of Technology Atlanta, GA, USA, ISyE
Sebastian Pokutta
  • Georgia Institute of Technology Atlanta, GA, USA, ISyE
Daniel Zink
  • Georgia Institute of Technology Atlanta, GA, USA, ISyE
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1300144
DBLP Key: conf/stoc/BraunPZ15
Author Comments:

Discuss this paper and its artifacts below