Approximation algorithms for requirement cut on graphs (Q848961): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-008-9171-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-008-9171-5 / rank | |||
Normal rank | |||
Revision as of 10:56, 9 December 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
