Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1801.10416 / rank | |||
Normal rank | |||
Revision as of 06:01, 19 April 2024
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
