مرکز منطقه ای اطلاع رساني علوم و فناوري - Inapproximability and a polynomially solvable special case of a network improvement problem

Title of article :

Inapproximability and a polynomially solvable special case of a network improvement problem

Author/Authors :

J. Z. Zhang، نويسنده , , X. G. Yang، نويسنده , , M. C. Cai، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2004

Pages :

From page :

251

To page :

257

Keywords :

Network flows , MAXIMUM 3-SATISFIABILITY , Shortest path , Inapproximability

Journal title :

European Journal of Operational Research

Serial Year :

2004

Journal title :

European Journal of Operational Research

Record number :

214896

Link To Document :