An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds for incremental medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental medians via online bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online clustering with variable sized clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds on online unit clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio for online facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online sum-radii clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Center Problem with Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Model for Combinatorial Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for incremental approximation and hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base station placement on boundary of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hierarchical location problems / rank
 
Normal rank

Latest revision as of 23:57, 10 July 2024

scientific article
Language Label Description Also known as
English
An incremental version of the \(k\)-center problem on boundary of a convex polygon
scientific article

    Statements

    An incremental version of the \(k\)-center problem on boundary of a convex polygon (English)
    0 references
    0 references
    0 references
    0 references
    3 November 2015
    0 references
    \(k\)-center
    0 references
    facility location
    0 references
    incremental algorithm
    0 references
    competitive ratio
    0 references

    Identifiers