مرکز منطقه ای اطلاع رساني علوم و فناوري - Weighted Coloring: further complexity and approximability results

Title of article :

Weighted Coloring: further complexity and approximability results

Author/Authors :

Bruno Escoffier، نويسنده , , Jérôme Monnot، نويسنده , , Vangelis Th. Paschos، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2006

Pages :

From page :

To page :

103

Keywords :

approximation algorithms , NP-complete problems , Weighted coloring , Interval graphs , Line graph of bipartite graphs , Partial k-tree

Journal title :

Information Processing Letters

Serial Year :

2006

Journal title :

Information Processing Letters

Record number :

130190

Link To Document :