10 citations · 16 across the 3 of their papers we have counts for
1 paper · 2 filters
Uriel Feige
An NP-hard combinatorial optimization problem Π is said to have an {\em approximation threshold} if there is some t such that the optimal value of Π can be approximated in po…