Q5111721 (Q5111721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q194153 / rank
Normal rank
 
Property / author
 
Property / author: Tamal Krishna Dey / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: k-means++ / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1704.05964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kinetic spanners in R <sup>d</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering time series under the Fréchet distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for the kinetic robust \(k\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deformable spanners and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller coresets for \(k\)-median and \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coresets for k-means and k-median clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: How fast is the \(k\)-means method? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535022 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:30, 22 July 2024

scientific article; zbMATH DE number 7205012
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7205012

    Statements

    0 references
    0 references
    27 May 2020
    0 references
    clustering
    0 references
    multi-objective optimization
    0 references
    dynamic metric spaces
    0 references
    moving point sets
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references