Approximation algorithms for the 0-extension problem (Q2768266)
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 the 0-extension problem |
scientific article; zbMATH DE number 1699198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the 0-extension problem |
scientific article; zbMATH DE number 1699198 |
Statements
30 June 2002
0 references
approximation algorithms
0 references
metric relaxation
0 references
graph partitioning
0 references
Approximation algorithms for the 0-extension problem (English)
0 references
