Title of article :
Reductions, completeness and the hardness of approximability
Author/Authors :
G. Ausiello، نويسنده , , V.Th. Paschos، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2006
Pages :
21
From page :
719
To page :
739
Keywords :
Combinatorial optimization , complexity theory , NP-hard optimization problems , Polynomial approximation , Computing science , Completeness in approximation classes , Approximation preserving reduction
Journal title :
European Journal of Operational Research
Serial Year :
2006
Journal title :
European Journal of Operational Research
Record number :
215977
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=215977
بازگشت