An approximation ratio for biclustering (Q975394): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Consensus algorithms for the generation of all maximal bicliques / 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: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and bipartite subgraph listing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Clique and Biclique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for \(k\)-means clustering / rank
 
Normal rank

Latest revision as of 22:24, 2 July 2024

scientific article
Language Label Description Also known as
English
An approximation ratio for biclustering
scientific article

    Statements