Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (Q4458884)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2055959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width |
scientific article; zbMATH DE number 2055959 |
Statements
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (English)
0 references
14 March 2004
0 references
Approximation algorithms
0 references
Multicut
0 references
Polynomial-time approximation schemes
0 references
Tree-width
0 references
0.9521209597587584
0 references
0.9096644520759584
0 references
0.8582502007484436
0 references
