A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sur la séparation des ensembles convexes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of the Delsarte and Lovász bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hadamard determinants Möbius functions, and the chromatic number of a graph / rank | |||
Normal rank | |||
Latest revision as of 06:18, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A semidefinite programming hierarchy for packing problems in discrete geometry |
scientific article |
Statements
A semidefinite programming hierarchy for packing problems in discrete geometry (English)
0 references
19 June 2015
0 references
Lasserre hierarchy
0 references
weighted independence number (stability number)
0 references
infinite graphs
0 references
geometric packing problems
0 references
moment measures
0 references
