The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833)
From MaRDI portal
!
WARNING
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 7300920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? |
scientific article; zbMATH DE number 7300920 |
Statements
The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (English)
0 references
25 January 2021
0 references
complexity
0 references
FPT algorithms
0 references
approximation algorithms
0 references
maximum colorful arborescence
0 references
tandem mass spectrometry
0 references
0.985430896282196
0 references
0.9232257008552552
0 references
0.7585858702659607
0 references
0.7534568309783936
0 references
