Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567)
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 and approximation for the star \(p\)-hub routing cost problem in metric graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs |
scientific article |
Statements
Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (English)
0 references
13 June 2022
0 references
hub allocation
0 references
analysis of algorithms
0 references
problem complexity
0 references
approximation algorithms
0 references
metric graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
