مرکز منطقه ای اطلاع رساني علوم و فناوري - Approximability of maximum splitting of k-sets and some other Apx-complete problems

Title of article :

Approximability of maximum splitting of k-sets and some other Apx-complete problems

Author/Authors :

Viggo Kann، نويسنده , , Jens Lagergren، نويسنده , , Alessandro Panconesi، نويسنده ,

Issue Information :

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

Pages :

From page :

105

To page :

110

Keywords :

Combinatorial problems , computational complexity , Algorithms , approximation

Journal title :

Information Processing Letters

Serial Year :

1996

Journal title :

Information Processing Letters

Record number :

128470

Link To Document :