Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696)
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 relaxations for minimum bandwidth and other vertex-ordering problems |
scientific article; zbMATH DE number 1454432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems |
scientific article; zbMATH DE number 1454432 |
Statements
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (English)
0 references
4 June 2000
0 references
approximation algorithms
0 references
semi-definite programming
0 references
minimum bandwidth problem
0 references
0 references
0 references
0.9038358
0 references
0.8972422
0 references
0.8953857
0 references
0.8953857
0 references
0.8805169
0 references
0.87793916
0 references
