On the parameterized complexity of consensus clustering (Q2015135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4365126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average parameterization and partial kernelization for computing medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of correlation clustering and consensus clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized PTAS for the minimum consensus clustering with a fixed number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search: is brute-force avoidable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of local search for TSP, more refined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental list coloring of graphs, parameterized by conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search and Placement of Meters in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of losing weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable assignment with couples: parameterized complexity and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical aspects of local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in K-means Clustering / rank
 
Normal rank

Latest revision as of 16:22, 8 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of consensus clustering
scientific article

    Statements

    On the parameterized complexity of consensus clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-hard problem
    0 references
    data clustering
    0 references
    search tree algorithm
    0 references
    local search
    0 references
    0 references