NP-hardness of the Euclidean Max-Cut problem-Reference-Cited by-同舟云学术

NP-hardness of the Euclidean Max-Cut problem

Published:2014-05 Issue:3 Volume:89 Page:343-345
ISSN:1064-5624
Container-title:Doklady Mathematics
language:en
Short-container-title:Dokl. Math.

Author:

Ageev A. A.,Kel’manov A. V.,Pyatkin A. V.

Publisher

Pleiades Publishing Ltd

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1134/S1064562414030235.pdf

Reference14 articles.

1. F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, Oper. Res. 36, 493–513 (1988).

2. M. Bern and D. Eppstein, in Approximation Algorithms for NP-Hard Problems (PWS Boston, 1997), pp. 296–345.

3. T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser, Combinatorica 7(2), 171–191 (1987).

4. C. H. Q. Ding, He Xiaofeng, Zha Hongyuan, Gu Ming, H. D. Simon, in Proceedings of IEEE Inter-national Conference on Data Mining, San Jose, California, Nov. 29-Dec. 2, 2001 (IEEE Comput. Soc., Los Alamitos (CA), 2001), pp. 107–114.

5. A. Eisenblätter, in Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, Cambridge (MA), May 27–29, 2002 (Springer, Berlin, 2002), Lect. Notes Comput. Sci. 2337, 273–290 (2002).

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022

2. Efficient k-means based clustering scheme for mobile networks cell sites management;Journal of King Saud University - Computer and Information Sciences;2020-11

3. On the Hardness of Energy Minimisation for Crystal Structure Prediction;SOFSEM 2020: Theory and Practice of Computer Science;2020

4. Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset;Lecture Notes in Computer Science;2018

5. On the complexity of some quadratic Euclidean 2-clustering problems;Computational Mathematics and Mathematical Physics;2016-03