ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP
Article URLs:
Alternative Article URLs:
Authors: Daniel Prusa
  • Czech Technical University, Faculty of Electrical Engineering
Tomás Werner
  • Czech Technical University, Faculty of Electrical Engineering
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/PrusaW17
Author Comments:

Discuss this paper and its artifacts below