Max-Min Problems of Searching for Two Disjoint Subsets (Q6488359): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Data Mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A streaming algorithm for 2-center with outliers in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of some max-min clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank
 
Normal rank

Latest revision as of 11:54, 3 December 2024

scientific article; zbMATH DE number 7674461
Language Label Description Also known as
English
Max-Min Problems of Searching for Two Disjoint Subsets
scientific article; zbMATH DE number 7674461

    Statements

    Identifiers