Pages that link to "Item:Q5899507"
From MaRDI portal
The following pages link to Expander flows, geometric embeddings and graph partitioning (Q5899507):
Displayed 22 items.
- Continuum limit of total variation on point clouds (Q261295) (← links)
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)