Title of article
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Author/Authors
Artur Czumaj، نويسنده , , Magn?s M. Halld?rsson، نويسنده , , Andrzej Lingas، نويسنده , , Johan Nilsson، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
5
From page
49
To page
53
Keywords
approximation algorithms , NP-hard problems , Partial k-trees , Bounded treewidth
Journal title
Information Processing Letters
Serial Year
2005
Journal title
Information Processing Letters
Record number
130059
Link To Document