Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1982890
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander Kel'Manov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154035 / 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: Q3115255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of some quadratic Euclidean 2-clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some quadratic Euclidean 2-clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a vector subset search problem / 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: An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning 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: Q4181272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized approximation scheme for metric MAX-CUT / 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: P-Complete Approximation Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1990478916030054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2511842786 / rank
 
Normal rank

Latest revision as of 08:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Exact pseudopolynomial algorithms for a balanced 2-clustering problem
scientific article

    Statements

    Exact pseudopolynomial algorithms for a balanced 2-clustering problem (English)
    0 references
    0 references
    0 references
    9 February 2017
    0 references
    Euclidean space
    0 references
    balanced clustering
    0 references
    NP-hardness
    0 references
    integer inputs
    0 references
    fixed space dimension
    0 references
    exact pseudo-polynomial algorithm
    0 references

    Identifiers