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.
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit (Q368099) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Amenability, locally finite spaces, and bi-Lipschitz embeddings (Q392144) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- Diameters, distortion, and eigenvalues (Q444413) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- The non-linear geometry of Banach spaces after Nigel Kalton (Q485878) (← links)
- Lipschitz factorization through subsets of Hilbert space (Q489070) (← links)
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces (Q529376) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Metric differentiation, monotonicity and maps to \(L^{1}\) (Q607646) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- On the optimality of gluing over scales (Q635762) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Constant distortion embeddings of symmetric diversities (Q729694) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Topology-invariant similarity of nonrigid shapes (Q847482) (← 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)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- On average distortion of embedding metrics into the line (Q938313) (← links)
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm (Q1004316) (← links)
- Low distortion Euclidean embeddings of trees (Q1269777) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Randomized nonlinear projections uncover high-dimensional structure (Q1373440) (← links)
- On embedding expanders into \(\ell_p\) spaces (Q1376045) (← links)
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra (Q1582485) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Symmetric graph properties have independent edges (Q1641017) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Lower bounds for the low-rank matrix approximation (Q1681803) (← links)
