Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6101552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues |
scientific article; zbMATH DE number 6101552 |
Statements
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (English)
0 references
2 November 2012
0 references
semidefinite programming
0 references
Lasserre hierarchy
0 references
graph Laplacian
0 references
expander graph
0 references
ordering problem
0 references
1.0000001
0 references
0.9159082
0 references
0.89256954
0 references
0.89069784
0 references
0 references
0 references
0.8738334
0 references
0.8734268
0 references
0.87262684
0 references
