Parameterized complexity of categorical clustering with size constraints (Q6098152): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Achieving anonymity via clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for <i>ℓ<sub>p</sub></i>-Low Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3526663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation / 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: Matroid and knapsack center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the single individual SNP haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Low-rank Binary Matrix Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized low-rank binary matrix approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized \(k\)-clustering: tractability island / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / 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: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closest Substring Problems with Small Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for geometric min-sum median clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Free Trees / rank
 
Normal rank

Revision as of 08:09, 1 August 2024

scientific article; zbMATH DE number 7695015
Language Label Description Also known as
English
Parameterized complexity of categorical clustering with size constraints
scientific article; zbMATH DE number 7695015

    Statements

    Parameterized complexity of categorical clustering with size constraints (English)
    0 references
    0 references
    0 references
    0 references
    12 June 2023
    0 references
    categorical clustering
    0 references
    \(k\)-median
    0 references
    fixed-parameterized algorithm
    0 references
    kernelization
    0 references

    Identifiers