On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168)
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: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function |
scientific article; zbMATH DE number 2117692
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function |
scientific article; zbMATH DE number 2117692 |
Statements
On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (English)
0 references
22 November 2004
0 references
Graph colouring
0 references
approximation algorithms
0 references
satisfiability
0 references
semidefinite programming
0 references
Lovász \(\vartheta\)-function
0 references
MAX-\(k\)-CUT
0 references
0.8959905
0 references
0.8933202
0 references
0 references
0.8878247
0 references
0.8875164
0 references
0.88725036
0 references
