مرکز منطقه ای اطلاع رساني علوم و فناوري - Hardness results and approximation algorithms of k-tuple domination in graphs

Title of article :

Hardness results and approximation algorithms of k-tuple domination in graphs

Author/Authors :

Ralf Klasing، نويسنده , , Christian Laforest، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Combinatorial problems , approximation algorithms , Domination problems

Journal title :

Information Processing Letters

Serial Year :

2004

Journal title :

Information Processing Letters

Record number :

159107

Link To Document :