The following pages link to Geometry of cuts and metrics (Q5906765):
Displaying 50 items.
- Embeddability of open-ended carbon nanotubes in hypercubes (Q2269837) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Stolarsky's invariance principle for projective spaces (Q2283127) (← links)
- Injective metrizability and the duality theory of cubings (Q2292420) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Covering aspects of the Niemeier lattices (Q2311356) (← links)
- Channel metrization (Q2311357) (← links)
- Graphs and spherical two-distance sets (Q2311376) (← links)
- On fractional cut covers (Q2312658) (← links)
- Admissible Bernoulli correlations (Q2325265) (← links)
- Lattices from tight frames and vertex transitive graphs (Q2325750) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- A direct proof that \(\ell_\infty^{(3)}\) has generalized roundness zero (Q2348144) (← links)
- The reverse Hlawka inequality in a Minkowski space (Q2352224) (← links)
- The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination (Q2354428) (← links)
- The realization problem for tail correlation functions (Q2363664) (← links)
- Infinite series of extreme Delaunay polytopes (Q2368707) (← links)
- Characterizations of pseudo-codewords of (low-density) parity-check codes (Q2370162) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- Linearly independent split systems (Q2372440) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- Addendum to: ``Lattices from equiangular tight frames'' (Q2402480) (← links)
- On finding convex cuts in general, bipartite and plane graphs (Q2402674) (← links)
- Boolean quadric polytopes are faces of linear ordering polytopes (Q2403680) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Metric transforms yielding Gromov hyperbolic spaces (Q2417668) (← links)
- Minimal webs in Riemannian manifolds (Q2427422) (← links)
- Metric characterization of apartments in dual polar spaces (Q2431605) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models (Q2457328) (← links)
- A counterexample to the dominating set conjecture (Q2458916) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Variations of a combinatorial problem on finite sets (Q2470896) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
- Roundness properties of groups. (Q2494092) (← links)
- The isometries of the cut, metric and hypermetric cones (Q2494270) (← links)
- \(\Theta\)-graceful labelings of partial cubes (Q2497465) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- An upper bound for a valence of a face in a parallelohedral tiling (Q2509699) (← links)
