FPT Approximation for Constrained Metric k-Median/Means (Q6089659): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Constant-Factor FPT Approximation for Capacitated k-Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving anonymity via clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / 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: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the constrained \(k\)-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365019 / 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: Proportional Approval Voting, Harmonic k-median, and Negative Association / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More / 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: On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster balanced clusterings in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for Clustering Constrained Data without Locality Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for k-means clustering based on weak coresets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Yields a PTAS for $k$-Means in Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Norms and All-L_p-Norms Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i> -Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clustering algorithm based on graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering 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: Constant approximation for k-median and k-means with outliers via iterative rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time approximation schemes for clustering problems in any dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating capacitated <i>k</i>-median with (1 + ∊)<i>k</i> open facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating k-median via pseudo-approximation / 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: Tight Running Time Lower Bounds for Strong Inapproximability of Maximum <i>k</i>-Coverage, Unique Set Cover and Related Problems (via <i>t</i>-Wise Agreement Testing Theorem) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-means requires exponentially many iterations even in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling with a reservoir / rank
 
Normal rank

Revision as of 12:59, 3 August 2024

scientific article; zbMATH DE number 7764105
Language Label Description Also known as
English
FPT Approximation for Constrained Metric k-Median/Means
scientific article; zbMATH DE number 7764105

    Statements

    0 references
    0 references
    0 references
    13 November 2023
    0 references
    \(k\)-means
    0 references
    \(k\)-median
    0 references
    approximation algorithms
    0 references
    parameterised algorithms
    0 references
    FPT Approximation for Constrained Metric k-Median/Means (English)
    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