Approximation algorithms for requirement cut on graphs (Q848961): Difference between revisions
From MaRDI portal
Revision as of 11:16, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for requirement cut on graphs |
scientific article |
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