Computing sharp bounds for hard clustering problems on trees (Q1028427)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing sharp bounds for hard clustering problems on trees
scientific article

    Statements

    Computing sharp bounds for hard clustering problems on trees (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    contiguity-constrained clustering
    0 references
    trees
    0 references
    heuristics
    0 references
    computational complexity
    0 references
    linear programming
    0 references
    integer programming
    0 references
    clustering problems
    0 references
    data base paging
    0 references
    comuunication networks
    0 references
    distribution networks
    0 references
    districting
    0 references
    biological taxonomy
    0 references
    optimal tree partitioning problems
    0 references
    0 references