Q5009501 (Q5009501): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.9 / 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: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outlier Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for stable and perturbation-resilient problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Center-based clustering under perturbation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Spectral-Norm Bounds for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Center Clustering Under Perturbation Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering under Perturbation Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the practically interesting instances of MAXCUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Stable Instances Easy? / 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: Q4598206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate / 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: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / 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: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.APPROX-RANDOM.2018.9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:36, 30 December 2024

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

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    clustering
    0 references
    perturbation resilience
    0 references
    LP integrality
    0 references
    outliers
    0 references
    beyond worst case analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers