Parameterized complexity dichotomy for Steiner Multicut (Q2954992)
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 6677392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity dichotomy for Steiner Multicut |
scientific article; zbMATH DE number 6677392 |
Statements
24 January 2017
0 references
graph cut problems
0 references
Steiner cut
0 references
fixed-parameter tractability
0 references
0.9755632877349854
0 references
0.8449292778968811
0 references
0.8434028029441833
0 references
0.8366679549217224
0 references
0.8235604166984558
0 references
