An approximation algorithm for the maximum spectral subgraph problem (Q2082202)
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: An approximation algorithm for the maximum spectral subgraph problem |
scientific article; zbMATH DE number 7595923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the maximum spectral subgraph problem |
scientific article; zbMATH DE number 7595923 |
Statements
An approximation algorithm for the maximum spectral subgraph problem (English)
0 references
4 October 2022
0 references
approximation algorithm
0 references
relaxation and rounding
0 references
semidefinite programming
0 references
spectral graph theory
0 references
random graphs
0 references
0 references
0 references
0.94518703
0 references
0.92402744
0 references
0.9167761
0 references
0.9167761
0 references
0.9101248
0 references
0.90344083
0 references
0.90104634
0 references
0.9002914
0 references
0.9002914
0 references
