Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Outward rotations / rank | |||
Normal rank | |||
Revision as of 01:43, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation |
scientific article |
Statements
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (English)
0 references
11 March 2008
0 references
quadratic maximization
0 references
max-cut problem
0 references
semidefinite programming relaxation
0 references
approximation algorithm
0 references
performance ratio
0 references
