Approximation algorithms for requirement cut on graphs (Q848961): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-008-9171-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138522610 / rank | |||
Normal rank | |||
Revision as of 22:39, 19 March 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
