Under the assumption EXPTIME NEXPTIME, we show the nonexistence of polynomial-time bounded-error approximation algorithms solving the M AX-Selection problem. In addition, a linear re- duction from the MAX2SAT problem to the MAX-Selection problem is given. Therefore, if there exists a polynomial-time approximation scheme for the MAX-Selection problem, then P NP.
Herbert Baier hasn't uploaded this paper.
Create a free Academia account to let Herbert know you want this paper to be uploaded.
