NP-hardness of the Euclidean Max-Cut problem Full article
Journal |
Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362 |
||||
---|---|---|---|---|---|
Output data | Year: 2014, Volume: 89, Number: 3, Pages: 343-345 Pages count : 3 DOI: 10.1134/s1064562414030235 | ||||
Authors |
|
||||
Affiliations |
|
Cite:
Ageev A.A.
, Kel’manov A.V.
, Pyatkin A.V.
NP-hardness of the Euclidean Max-Cut problem
Doklady Mathematics. 2014. V.89. N3. P.343-345. DOI: 10.1134/s1064562414030235 WOS Scopus OpenAlex
NP-hardness of the Euclidean Max-Cut problem
Doklady Mathematics. 2014. V.89. N3. P.343-345. DOI: 10.1134/s1064562414030235 WOS Scopus OpenAlex
Identifiers:
Web of science: | WOS:000339402700023 |
Scopus: | 2-s2.0-84904333199 |
OpenAlex: | W2000311458 |