Pages that link to "Item:Q5383975"
From MaRDI portal
The following pages link to An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975):
Displayed 32 items.
- Lower bounds for in-network computation of arbitrary functions (Q1981801) (← links)
- Alternating minimization methods for strongly convex optimization (Q2232092) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- Computing Weighted Strength and Applications to Partitioning (Q4558887) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← 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)
- (Q4638113) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration (Q5090297) (← links)
- (Q5091234) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- (Q5111734) (← links)
- Hardness Results for Structured Linear Systems (Q5117379) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- Fast Augmenting Paths by Random Sampling from Residual Graphs (Q5252688) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Minimum cost flow in the CONGEST model (Q6148076) (← links)
- Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225) (← links)
- Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique (Q6202226) (← links)