The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.SWAT.2018.19 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.4230/LIPICS.SWAT.2018.19 / rank
 
Normal rank

Latest revision as of 15:59, 30 December 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

    0 references
    0 references
    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
    The Parameterized Hardness of the k-Center Problem in Transportation Networks (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references