New algorithms for \(k\)-center and extensions (Q849133): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-009-9226-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797707629 / rank
 
Normal rank

Revision as of 21:48, 19 March 2024

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
    0 references