The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483)
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: The Parameterized Hardness of the k-Center Problem in Transportation Networks |
scientific article; zbMATH DE number 7238974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Parameterized Hardness of the k-Center Problem in Transportation Networks |
scientific article; zbMATH DE number 7238974 |
Statements
25 August 2020
0 references
\(k\)-center
0 references
parameterized complexity
0 references
planar graphs
0 references
doubling dimension
0 references
highway dimension
0 references
treewidth
0 references
0 references
0 references
0 references
The Parameterized Hardness of the k-Center Problem in Transportation Networks (English)
0 references
