Complexity results on restricted instances of a paint shop problem for words (Q2492209)
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 5030498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results on restricted instances of a paint shop problem for words |
scientific article; zbMATH DE number 5030498 |
Statements
Complexity results on restricted instances of a paint shop problem for words (English)
0 references
9 June 2006
0 references
APX-hardness
0 references
binary matroids
0 references
maxflow-mincut
0 references
paint shop
0 references
NP-completeness
0 references
sequencing
0 references
0 references
0.8512881
0 references
0 references
0.8486843
0 references
0.8477372
0 references
0.8326999
0 references
