Integer Linear Program
l
Variable
x
vw
=1
if buy edge
vw
l
Solution cost
S
x
vw
c
vw
l
Constraint: for every cut,
S
x
vw
³
k
l
Relaxing integrality gives tractable LP
»
Exponentially many cuts
»
But separation oracles exist (eg min-cut)
l
What is integrality gap?