Approximation algorithms for maximization problems arising in graph partitioning (Q2775885)
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: Approximation algorithms for maximization problems arising in graph partitioning |
scientific article; zbMATH DE number 1714183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for maximization problems arising in graph partitioning |
scientific article; zbMATH DE number 1714183 |
Statements
8 July 2002
0 references
semidefinite programming
0 references
0.9685986
0 references
0.9682271
0 references
0.9645781
0 references
0.9473276
0 references
0.9473276
0 references
0.9417434
0 references
0.9403753
0 references
0.9379684
0 references
Approximation algorithms for maximization problems arising in graph partitioning (English)
0 references
