Vaidya ( Linear Programming)

From Algorithm Wiki

Revision as of 11:17, 15 February 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

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

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/63499

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Vaidya_(_Linear_Programming)&oldid=45617"