On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function |
scientific article |
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
