Title of article :
A natural family of optimization problems with arbitrarily small approximation thresholds
Author/Authors :
Venkatesan Guruswami، نويسنده , , C. Pandu Rangan، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Keywords :
approximation algorithm , NP-hardness , hardness of approximation , Approximation threshold: PTAS: Independent set problem , Edge domination , computational complexity , Total graphs
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
