Approximation algorithms for requirement cut on graphs (Q848961)
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 requirement cut on graphs |
scientific article; zbMATH DE number 5674334
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for requirement cut on graphs |
scientific article; zbMATH DE number 5674334 |
Statements
Approximation algorithms for requirement cut on graphs (English)
0 references
23 February 2010
0 references
graph partitioning
0 references
cut problems
0 references
approximation algorithms
0 references
0 references
0 references
0 references
1.0000001
0 references
0.9326242
0 references
0.9020246
0 references
0.90157783
0 references
0.9004373
0 references
0 references
0 references
0.8915065
0 references
