An improved approximation algorithm for requirement cut (Q991474)
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 improved approximation algorithm for requirement cut |
scientific article; zbMATH DE number 5780112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for requirement cut |
scientific article; zbMATH DE number 5780112 |
Statements
An improved approximation algorithm for requirement cut (English)
0 references
7 September 2010
0 references
graph partitioning
0 references
approximation algorithms
0 references
requirement cut problem
0 references
0 references
0 references
0.9262199401855468
0 references
0.9249195456504822
0 references
0.8035323023796082
0 references
0.8035320043563843
0 references
