Title of article

Near-optimal nonapproximability results for some PB-complete problems

Author/Authors

P. Jonsson، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 1998

Pages

5

From page

249

To page

253

Keywords

computational complexity , Combinatorial problems , approximation

Journal title

Information Processing Letters

Serial Year

1998

Journal title

Information Processing Letters

Record number

128995