New algorithms for \(k\)-center and extensions (Q849133)

From MaRDI portal
Revision as of 12:19, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New algorithms for \(k\)-center and extensions
scientific article

    Statements

    New algorithms for \(k\)-center and extensions (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    0 references
    approximation algorithms
    0 references
    branch-and-bound
    0 references
    computational geometry
    0 references
    geometric inequalities
    0 references
    containment
    0 references
    core-sets
    0 references
    diameter partition
    0 references
    SOCP
    0 references
    2-SAT
    0 references
    0 references
    0 references
    0 references