Sökning: "ES-tree"
Hittade 1 uppsats innehållade ordet ES-tree.
1. Approximating multi-commodity max-flow in practice
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Garg and Könemann developed a framework for computing multi-commodity maximum flow in a graph, later called a multiplicative weight update framework. Madry used this framework and exchanged Dijkstra’s algorithm to a dynamic graph algorithm for approximating the shortest paths through the graph. LÄS MER
Resultatsidor:
1