Advances, Systems and Applications
Table 1 Worst-case time complexity for min-cost algorithms
From: DRMaestro: orchestrating disaggregated resources on virtualized data-centers
Algorithm | Worst-case complexity |
|---|---|
Cycle canceling | O(KNM2CU) |
Successive shortest path | O(KN2Mlog(NC)) |
Cost Scaling | O(KN2Ulog(N)) |