Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (Q2773169)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. |
scientific article; zbMATH DE number 1709312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. |
scientific article; zbMATH DE number 1709312 |
Statements
2001
0 references
graph coloring
0 references
discrete optimization
0 references
semidefinite programming
0 references
frequency assignment
0 references
hypergraph coloring
0 references
0 references
Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (English)
0 references
