Pages that link to "Item:Q3158558"
From MaRDI portal
The following pages link to Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558):
Displaying 50 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Lattice flows in networks (Q522926) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- Flow metrics (Q596135) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Algorithms for the universal and a priori TSP (Q924875) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- Sparsest cuts and concurrent flows in product graphs. (Q1427176) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity (Q1717975) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- On the expansion and diameter of bluetooth-like topologies (Q1946491) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- A queueing network-based distributed Laplacian solver (Q1979459) (← links)
- Lower bounds for in-network computation of arbitrary functions (Q1981801) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Bounds on maximum concurrent flow in random bipartite graphs (Q2228396) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
