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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
The Parameterized Hardness of the k-Center Problem in Transportation Networks (English)
0 references
0.9945253133773804
0 references
0.9106014966964722
0 references
0.8895601034164429
0 references
0.8852646946907043
0 references
0.7575390934944153
0 references
