David S. Kung
DAC 1998
M. Serna recently proved that approximating linear programming is log-space complete for P. This note shows a direct reduction of the exact problem to Serna' approximate one. © 1992.
David S. Kung
DAC 1998
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev