مرکز منطقه ای اطلاع رساني علوم و فناوري - An -approximation algorithm for directed sparsest cut

Title of article :

An -approximation algorithm for directed sparsest cut

Author/Authors :

Mohammad Taghi Hajiaghayi، نويسنده , , Harald R?cke، نويسنده ,

Issue Information :

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

Pages :

From page :

156

To page :

160

Keywords :

approximation algorithms , Sparsest cut , Directed graphs , Multicommodity flow

Journal title :

Information Processing Letters

Serial Year :

2006

Journal title :

Information Processing Letters

Record number :

130200

Link To Document :