Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem |
scientific article |
Statements
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (English)
0 references
25 June 2019
0 references
clustered shortest-path tree problem
0 references
hardness
0 references
approximation algorithms
0 references
fixed-parameter tractability
0 references
network design
0 references
