Tight FPT approximation for socially fair clustering (Q6161442): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4321486958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of essentially fair clusterings / 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: 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: A new coreset framework for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: FPT Approximation for Constrained Metric k-Median/Means / 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: Q3761689 / 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: On Uniform Capacitated <i>k</i> -Median Beyond the Natural LP Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / 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: On the Parameterized Complexity of Approximating Dominating Set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:28, 1 August 2024

scientific article; zbMATH DE number 7691942
Language Label Description Also known as
English
Tight FPT approximation for socially fair clustering
scientific article; zbMATH DE number 7691942

    Statements

    Tight FPT approximation for socially fair clustering (English)
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    clustering
    0 references
    approximation algorithms
    0 references
    \(k\)-means
    0 references
    fixed-parameter tractability
    0 references
    fairness
    0 references

    Identifiers