An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of the Euclidean Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2998954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-approximation algorithm for finding a clique with minimum weight of vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some data analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some cluster analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a search for a subset of ``similar'' vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of certain problems of searching for subsets of vectors and cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of some problems of cluster analysis of vector sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation polynomial algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two-cluster partition of a set of vectors / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sum of squares clustering in a low dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1990478915040067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2275454988 / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
scientific article

    Statements

    An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (English)
    0 references
    12 August 2016
    0 references
    partitioning
    0 references
    vector subset
    0 references
    squared Euclidean distance
    0 references
    NP-hardness
    0 references
    exact pseudopolynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers