Pages that link to "Item:Q1894703"
From MaRDI portal
The following pages link to The geometry of graphs and some of its algorithmic applications (Q1894703):
Displaying 50 items.
- Negative-type diversities, a multi-dimensional analogue of negative-type metrics (Q2659479) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization (Q2800802) (← links)
- Book review of: M. I. Ostrovskii, Metric embeddings: Bilipschitz and coarse embedddings into Banach spaces (Q2810916) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Union of Euclidean metric spaces is Euclidean (Q2826222) (← links)
- On metric characterizations of some classes of Banach spaces (Q2844651) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Low Distortion Metric Embedding into Constant Dimension (Q3010393) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization (Q3130749) (← links)
- (Q3140432) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY (Q3398976) (← links)
- The geometry of crashes. A measure of the dynamics of stock market crises (Q3439868) (← links)
- Symmetric Graph Properties Have Independent Edges (Q3449496) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- A smoothing majorization method for matrix minimization (Q3458812) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Compression functions of uniform embeddings of groups into Hilbert and Banach spaces (Q3647067) (← links)
- The cut cone,L1 embeddability, complexity, and multicommodity flows (Q3984283) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Representation and coding of signal geometry (Q4603712) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- Metric Curvatures Revisited: A Brief Overview (Q4609918) (← links)
- On the equivalence between low-rank matrix completion and tensor rank (Q4640079) (← links)
- A semidefinite bound for mixing rates of Markov chains (Q4645923) (← links)
- A NOTE ON NON-AMENABILITY OF ℬ(ℓ<sub>p</sub>) FOR p=1,2 (Q4820976) (← links)
- (Q4885584) (← links)
- Proximity-preserving labeling schemes (Q4948512) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
- (Q5009588) (← links)
- FPT algorithms for embedding into low complexity graphic metrics (Q5009595) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- (Q5088977) (← links)
- Diversity-normed spaces and diversity embeddings (Q5097200) (← links)
- Lipschitz-free Spaces on Finite Metric Spaces (Q5110164) (← links)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (Q5115789) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- The Geometry of Computation-Graph Abstraction (Q5145351) (← links)
