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

From MaRDI portal
Publication:1428068

DOI10.1016/S0377-2217(02)00876-7zbMATH Open1045.90011OpenAlexW2056975114MaRDI QIDQ1428068FDOQ1428068

Jianzhong Zhang, Xiaoguang Yang, Mao-Cheng Cai

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00876-7




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Inapproximability and a polynomially solvable special case of a network improvement problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428068)