Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (Q4638584)

From MaRDI portal
Revision as of 13:13, 11 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 6865278
Language Label Description Also known as
English
Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
scientific article; zbMATH DE number 6865278

    Statements

    Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2018
    0 references
    \(p\)-centered partitions
    0 references
    tree partitioning
    0 references
    flat costs
    0 references
    min-sum criterion
    0 references
    min-max criterion
    0 references
    range criterion
    0 references
    uniform partitions
    0 references
    exactly uniform 2-centered partition
    0 references
    capacitated partitions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references