Vaidya ( Linear Programming): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tags: Manual revert Reverted
No edit summary
Tag: Manual revert
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


== Space Complexity ==  
== Space Complexity ==  
Line 27: Line 27:
== Year ==  
== Year ==  


1987
1989


== Reference ==  
== Reference ==  


https://link.springer.com/article/10.1007/BF01580859
https://ieeexplore.ieee.org/document/63499

Latest revision as of 09:41, 28 April 2023

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/document/63499