Complexity of the weighted max-cut in Euclidean space Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2014, Volume: 8, Number: 4, Pages: 453-457 Pages count : 5 DOI: 10.1134/s1990478914040012 | ||||
| Tags | cut; Euclidean space; graph; NP-hard problem | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Ageev A.A.
, Kel’manov A.V.
, Pyatkin A.V.
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics. 2014. V.8. N4. P.453-457. DOI: 10.1134/s1990478914040012 Scopus OpenAlex
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics. 2014. V.8. N4. P.453-457. DOI: 10.1134/s1990478914040012 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-84911953693 |
| OpenAlex: | W2037094620 |