Pages that link to "Item:Q5495846"
From MaRDI portal
The following pages link to A new approach to computing maximum flows using electrical flows (Q5495846):
Displaying 16 items.
- Electric routing and concurrent flow cutting (Q553348) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time (Q4575714) (← links)
- The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Area-convexity, l <sub>∞</sub> regularization, and undirected multicommodity flow (Q4977993) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- (Q5111734) (← links)
- Fast Augmenting Paths by Random Sampling from Residual Graphs (Q5252688) (← links)
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
- Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance (Q5883297) (← links)
- Resistance distances in directed graphs: definitions, properties, and applications (Q6589847) (← links)