Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-009-9235-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-009-9235-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992598798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in metric embedding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min-sum <i>k</i> -clustering in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better streaming algorithms for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i>-Median clustering in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Combinatorial Programs and Efficient Property Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear‐time approximation algorithms for clustering via random sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized approximation scheme for metric MAX-CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless Facility Location in One Pass / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coresets in dynamic geometric data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for min-sum \(p\)-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: Smaller coresets for \(k\)-median and \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective clustering in high dimensions using core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time algorithms for metric space problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for dynamic geometric problems over data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time bounds for approximate clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profit-earning facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(k\)-median algorithm with running time independent of data size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerant property testing and distance approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average distortion of embedding metrics into the line and into L <sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering for edge-cost minimization (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms for the minimum cost assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-009-9235-1 / rank
 
Normal rank

Latest revision as of 10:27, 10 December 2024

scientific article
Language Label Description Also known as
English
Small space representations for metric min-sum \(k\)-clustering and their applications
scientific article

    Statements

    Small space representations for metric min-sum \(k\)-clustering and their applications (English)
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    sublinear-time algorithms
    0 references
    sublinear-space algorithms
    0 references
    clustering
    0 references
    min-sum \(k\)-clustering
    0 references
    balanced \(k\)-median
    0 references
    streaming algorithms
    0 references
    coresets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers