Sciact
  • EN
  • RU

NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points Full article

Journal Computational Mathematics and Mathematical Physics
ISSN: 0965-5425 , E-ISSN: 1555-6662
Output data Year: 2018, Volume: 58, Number: 5, Pages: 822-826 Pages count : 5 DOI: 10.1134/s0965542518050123
Tags Euclidean space; norm of sum; NP-hardness; partitioning
Authors Kel’manov A.V. 1,2 , Pyatkin A.V. 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Kel’manov A.V. , Pyatkin A.V.
NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points
Computational Mathematics and Mathematical Physics. 2018. V.58. N5. P.822-826. DOI: 10.1134/s0965542518050123 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000435404100015
Scopus: 2-s2.0-85048616703
OpenAlex: W2807997940
Citing:
DB Citing
Scopus 3
OpenAlex 3
Web of science 5
Altmetrics: