Vaidya ( Linear Programming)

Time Complexity

$O(((m+n)$n^{2}+(m+n)^{1.5}*n)L^{2} logL loglogL)

Space Complexity

$O((nm+n^{2})$L)? words

(can be easily derived?)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://link.springer.com/article/10.1007/BF01580859