Improved approximation algorithms for maximum graph partitioning problems (Q813332)
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 5005138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for maximum graph partitioning problems |
scientific article; zbMATH DE number 5005138 |
Statements
Improved approximation algorithms for maximum graph partitioning problems (English)
0 references
8 February 2006
0 references
maximum graph partitioning
0 references
approximation factor
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0.9644321203231812
0 references
0.867107093334198
0 references
0.8599030375480652
0 references
0.8564444780349731
0 references
0.8541937470436096
0 references
