Geometry of cuts and metrics
\(l_1\) metricscut conecut polyhedraDelaunay polyhyper in latticeshypercube embeddable metricshypermetricsmetric structure at groups
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Distance in graphs (05C12) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorics in computer science (68R05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Springer has reissued this useful book (originally published in 1997) in soft covers, resulting in a significant reduction in price. There appears to be no change in the content; readers are referred to the original review [Geometry of cuts and metrics. Algorithms and Combinatorics. 15. Berlin: Springer. xii, 587 p. (1997; Zbl 0885.52001)].
- Constructing maximal slicings from geometry
- Vertical perimeter versus horizontal perimeter
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- The hypermetric cone and polytope on eight vertices and some generalizations
- On graphs of the cone decompositions for the min-cut and max-cut problems
- Inhomogeneous extreme forms
- Seminormality, canonical modules, and regularity of cut polytopes
- On the bi-Lipschitz geometry of lamplighter graphs
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- Coarsening in algebraic multigrid using Gaussian processes
- Similarity-reduced diversities: the effective entropy and the reduced entropy
- Order distances and split systems
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Generalized cut and metric polytopes of graphs and simplicial complexes
- Periodic triangulations of \(\mathbb{Z}^{n}\)
- Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- A proof of a conjecture by Haviv, Lyubashevsky and Regev on the second moment of a lattice Voronoi cell
- Daisy cubes and distance cube polynomial
- Delaunay polytopes derived from the Leech lattice
- Bounds on the number of 2-level polytopes, cones, and configurations
- Metric embeddings of Laakso graphs into Banach spaces
- Quadratic embedding constants of graph joins
- Exponential lower bounds for polytopes in combinatorial optimization
- From Graph Orientation to the Unweighted Maximum Cut
- On the diameter of lattice polytopes
- Hypercube emulation of interconnection networks topologies
- Convex excess in partial cubes
- Generalized network design polyhedra
- Distance geometry in quasihypermetric spaces. III
- Pythagorean powers of hypercubes
- Weakly Modular Graphs and Nonpositive Curvature
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- New Bell inequalities for the singlet state: Going beyond the Grothendieck bound
- Spectral bounds for the maximum cut problem
- TESTING EMBEDDABILITY BETWEEN METRIC SPACES
- OPTIMAL LOWER BOUND ON THE SUPREMAL STRICT p-NEGATIVE TYPE OF A FINITE METRIC SPACE
- Lifting and separation procedures for the cut polytope
- Geometry and combinatorics of the cutting angle method
- On the optimality of the random hyperplane rounding technique for MAX CUT
- Isometric embeddings of snowflakes into finite-dimensional Banach spaces
- A guide to conic optimisation and its applications
- Graphical models for correlated defaults
- The Running Intersection Relaxation of the Multilinear Polytope
- Ultrametricity of dissimilarity spaces and its significance for data mining
- A note on seminormality of cut polytopes
- Tight cycle relaxations for the cut polytope
- The Boolean quadric polytope
- Sherali-adams strikes back
- An improved analysis of local search for max-sum diversification
- Semi-supervised learning with regularized Laplacian
- Characterizing subgraphs of Hamming graphs
- Support sets in exponential families and oriented matroid theory
- Majorization and distances in trees
- scientific article; zbMATH DE number 5251757 (Why is no real title available?)
- Solving semidefinite programs using preconditioned conjugate gradients
- LSH-preserving functions and their applications
- Geometry of cuts and metrics
- On the bond polytope
- Contact vectors of point lattices
- Total positivity in multivariate extremes
- Classes of cut ideals and their Betti numbers
- Optimal nonparametric testing of missing completely at random and its connections to compatibility
- l₁-embeddability of shifted quadrilateral cylinder graphs
- Generalized cut polytopes for binary hierarchical models
- A semidefinite approach for the single row facility layout problem
- The codegree, weak maximum likelihood threshold, and the Gorenstein property of hierarchical models
- Clustering a mixture of Gaussians with unknown covariance
- Measure theoretical approach to almost periodicity
- Modern theory of electrical networks: from the matrix-tree theorem to the theory of cluster varieties
- Geodesic structures in Chebyshev and Manhattan metric spaces
- Variable aggregation and its effect on union bounding problem
- The metric cutpoint partition problem
- Cuts and semidefinite liftings for the complex cut polytope
- Hyperbolic space has strong negative type
- A nonlinear approach to dimension reduction
This page was built for publication: Geometry of cuts and metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902168)
