On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56874382, #quickstatements; #temporary_batch_1711486624475 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:joco.0000038911.67280.3f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2125240990 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 30 July 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
