Title of article
A natural family of optimization problems with arbitrarily small approximation thresholds
Author/Authors
Venkatesan Guruswami، نويسنده , , C. Pandu Rangan، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1998
Pages
8
From page
241
To page
248
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
Serial Year
1998
Journal title
Information Processing Letters
Record number
128994
Link To Document