Title of article :
It is hard to know when greedy is good for finding independent sets
Author/Authors :
Hans L. Bodlaender، نويسنده , , Dimitrios M. Thilikos، نويسنده , , Koichi Yamazaki، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1997
Pages :
6
From page :
101
To page :
106
Keywords :
analysis of algorithms , Combinatorial problems , Approximation algorithms
Journal title :
Information Processing Letters
Serial Year :
1997
Journal title :
Information Processing Letters
Record number :
128620
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128620
بازگشت