The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The Parameterized Hardness of the k-Center Problem in Transportation Networks | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8845/pdf/LIPIcs-SWAT-2018-19.pdf / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963629213 / rank | |||
Normal rank | |||
| Property / title | |||
The Parameterized Hardness of the k-Center Problem in Transportation Networks (English) | |||
| Property / title: The Parameterized Hardness of the k-Center Problem in Transportation Networks (English) / rank | |||
Normal rank | |||
Latest revision as of 09:00, 30 July 2024
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
