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):
Displaying 41 items.
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- 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)
- Near-optimal distributed maximum flow (extended abstract) (Q2796244) (← links)
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475) (← 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)
- Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time (Q4575714) (← 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)
- Conditional Lower Bounds for All-Pairs Max-Flow (Q4629955) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- (Q4638113) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Area-convexity, l <sub>∞</sub> regularization, and undirected multicommodity flow (Q4977993) (← 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)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
- Fast Augmenting Paths by Random Sampling from Residual Graphs (Q5252688) (← links)
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (Q5495844) (← 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)
- Resistance distances in directed graphs: definitions, properties, and applications (Q6589847) (← links)
