Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567)

From MaRDI portal
Revision as of 04:27, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

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