Online Sum-Radii Clustering

    Theoretical Computer Science, Volume 540, 2014, Pages 27-39.

    Cited by: 8|Bibtex|Views0|Links
    EI
    Keywords:
    competitive algorithmeuclidean planerandomized competitive ratiodeterministic odeterministic competitive ratioMore(11+)

    Abstract:

    In Online Sum-Radii Clustering, n demand points arrive online and must be irrevocably assigned to a cluster upon arrival. The cost of each cluster is the sum of a fixed opening cost and its radius, and the objective is to minimize the total cost of the clusters opened by the algorithm. We show that the deterministic competitive ratio of O...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments