The following pages link to Geometry of cuts and metrics (Q5906765):
Displaying 50 items.
- Small Cones of Oriented Semi-Metrics (Q4814266) (← links)
- Leggett-Garg inequalities and the geometry of the cut polytope (Q4903062) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- Binary Component Decomposition Part I: The Positive-Semidefinite Case (Q4999392) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- (Q5009572) (← links)
- FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES (Q5015719) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)
- Minkowski Geometry—Some Concepts and Recent Developments (Q5050924) (← links)
- Determining finite connected graphs along the quadratic embedding constants of paths (Q5061709) (← links)
- The Ratio-Cut Polytope and K-Means Clustering (Q5062119) (← links)
- (Q5089218) (← links)
- Explicit Construction of the Voronoi and Delaunay Cells of W(An) and W(Dn) Lattices and Their Facets (Q5127456) (← links)
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank (Q5145555) (← links)
- (Q5158503) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES (Q5227715) (← links)
- FINITE FLAT SPACES (Q5230048) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- (Q5239644) (← links)
- Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
- Threshold Dynamics for Networks with Arbitrary Surface Tensions (Q5247410) (← links)
- Does negative type characterize the round sphere? (Q5308139) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES (Q5377118) (← links)
- Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons (Q5378281) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- (Q5447636) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes (Q5865703) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5919792) (← links)
- Basis problem for turbulent actions. I: Tsirelson submeasures (Q5935990) (← links)
- Principal majorization ideals and optimization (Q5943030) (← links)
- On 0-1 polytopes with many facets (Q5945246) (← links)
- On the binary solitaire cone (Q5954234) (← links)
- Two theorems on Euclidean distance matrices and Gale transform (Q5956246) (← links)
- Some inequalities for central moments of matrices (Q5965398) (← links)
- Magnitude and Holmes–Thompson intrinsic volumes of convex bodies (Q6052794) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- Fuzzy compatibility relations and pseudo-monometrics: some correspondences (Q6083100) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- Hypercube embeddings and Cayley graphs generated by transpositions (Q6091746) (← links)
- Entanglement of free fermions on Johnson graphs (Q6110651) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Wasserstein distance and metric trees (Q6113469) (← links)
- Dimension reduction for maximum matchings and the fastest mixing Markov chain (Q6117114) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
