The following pages link to Algorithms – ESA 2005 (Q5475885):
Displaying 7 items.
- Fair matchings and related problems (Q270032) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory (Q5097012) (← links)
- Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
