Multicuts in unweighted graphs with bounded degree and bounded tree-width (Q3840353)
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 1187148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multicuts in unweighted graphs with bounded degree and bounded tree-width |
scientific article; zbMATH DE number 1187148 |
Statements
8 April 1999
0 references
hardness results
0 references
multicut problem
0 references
polynomial time approximation scheme
0 references
unweighted graphs
0 references
0.9895632
0 references
0.98609555
0 references
0.9446121
0 references
0.92894346
0 references
0.92572194
0 references
0 references
0.9098768
0 references
0.8981406
0 references
0 references
0 references
Multicuts in unweighted graphs with bounded degree and bounded tree-width (English)
0 references