Knapsack: connectedness, path, and shortest-path (Q6547953)
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 7857869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Knapsack: connectedness, path, and shortest-path |
scientific article; zbMATH DE number 7857869 |
Statements
Knapsack: connectedness, path, and shortest-path (English)
0 references
31 May 2024
0 references
knapsack
0 references
graph algorithms
0 references
parameterised complexity
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
