G. Ramalingam
Theoretical Computer Science
Paper
A note on approximate linear programming
Abstract
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.
Related
B. Wagle
EJOR
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research