Constant approximating disjoint paths on acyclic digraphs is W[1]-hard (Q7260679)
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 8208393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant approximating disjoint paths on acyclic digraphs is W[1]-hard |
scientific article; zbMATH DE number 8208393 |
Statements
Constant approximating disjoint paths on acyclic digraphs is W[1]-hard (English)
0 references
8 June 2026
0 references
fixed-parameter tractability
0 references
hardness of approximation
0 references
disjoint paths
0 references
0 references
0 references
0 references
0 references
