Sciweavers

FCT
2003
Springer
14 years 19 days ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora