On the parameterized complexity of clustering problems for incomplete data (Q2689366): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometric clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized k-Clustering: Tractability Island / 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: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Clustering: Theory, Algorithms, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees and limits of preprocessing in constraint satisfaction and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for Hamming clustering problems / 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: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity analysis for the closest string with wildcards problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Matrix Completion with Radius Constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition into triangles on bounded degree graphs / rank
 
Normal rank

Latest revision as of 16:56, 31 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of clustering problems for incomplete data
scientific article

    Statements

    On the parameterized complexity of clustering problems for incomplete data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    clustering
    0 references
    incomplete data
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references