Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / 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: An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concept decompositions for large sparse text data using clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the \(k\)-means problem with penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / 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: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seeding algorithm for \(k\)-means problem with penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar k-Means Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bi-Criteria Approximation Algorithm for k-Means / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate geometric \(k\)-clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant approximation for k-median and k-means with outliers via iterative rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant FPT approximation algorithm for hard-capacitated \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithm for universal facility location problem with linear penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithm for universal facility location problem with linear penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for the \(k\)-means problem with penalties / rank
 
Normal rank

Latest revision as of 05:44, 3 August 2024

scientific article; zbMATH DE number 7752205
Language Label Description Also known as
English
Effective Heuristic Techniques for Combined Robust Clustering Problem
scientific article; zbMATH DE number 7752205

    Statements

    Effective Heuristic Techniques for Combined Robust Clustering Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    robust clustering problem
    0 references
    \(k\)-means
    0 references
    local search scheme
    0 references
    approximation algorithm
    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