Pages that link to "Item:Q4388872"

The following pages link to An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872):

Displaying 37 items.

• Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
• Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
• A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces (Q529376) (← links)
• Metric differentiation, monotonicity and maps to \(L^{1}\) (Q607646) (← links)
• On the optimality of gluing over scales (Q635762) (← links)
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
• A note on multiflows and treewidth (Q834591) (← links)
• Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
• Approximation algorithms for requirement cut on graphs (Q848961) (← links)
• Semidefinite programming in combinatorial optimization (Q1365053) (← links)
• Sparsest cuts and concurrent flows in product graphs. (Q1427176) (← links)
• Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
• New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
• An introduction to the Ribe program (Q1936714) (← links)
• Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
• A simple algorithm for the multiway cut problem (Q2294387) (← links)
• Terminal embeddings (Q2405893) (← links)
• Pathwidth, trees, and random embeddings (Q2439830) (← links)
• Cut problems in graphs with a budget constraint (Q2457298) (← links)
• Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
• Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
• Metric structures in \(L_1\): dimension, snowflakes, and average distortion (Q2567204) (← links)
• Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
• Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
• Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
• (Q5002624) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• Euclidean distortion and the sparsest cut (Q5423920) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)
• The legacy of Jean Bourgain in geometric functional analysis (Q5854479) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)