مرکز منطقه ای اطلاع رساني علوم و فناوري - Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP

Title of article :

Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP

Author/Authors :

Edith Hemaspaandra، نويسنده , , J?rg Rothe، نويسنده ,

Issue Information :

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

Pages :

From page :

151

To page :

156

Keywords :

computational complexity , Appro:(imation , Maximum Independent Set problem

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128832

Link To Document :