Abstract

We show that a number of Npo PB-complete problems, including Min Ones and Max Ones, are hard to approximate within n 1 − ε for arbitrary ε > 0.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call