Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V. Complexity of the weighted max-cut in Euclidean space. (Russian, English) Zbl 1324.05188 Diskretn. Anal. Issled. Oper. 21, No. 4, 3-11 (2014); translation in J. Appl. Ind. Math. 8, No. 4, 453-457 (2014). MSC: 05C85 68Q17 05C22 PDF BibTeX XML Cite \textit{A. A. Ageev} et al., Diskretn. Anal. Issled. Oper. 21, No. 4, 3--11 (2014; Zbl 1324.05188); translation in J. Appl. Ind. Math. 8, No. 4, 453--457 (2014) Full Text: DOI
Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V. NP-hardness of the Euclidean Max-Cut problem. (English. Russian original) Zbl 1307.90212 Dokl. Math. 89, No. 3, 343-345 (2014); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 456, No. 5, 511-513 (2014). MSC: 90C60 90C27 PDF BibTeX XML Cite \textit{A. A. Ageev} et al., Dokl. Math. 89, No. 3, 343--345 (2014; Zbl 1307.90212); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 456, No. 5, 511--513 (2014) Full Text: DOI
Ageev, A. A.; Pyatkin, A. V. A 2-approximation algorithm for the metric 2-peripatetic salesman problem. (Russian) Zbl 1249.90296 Diskretn. Anal. Issled. Oper. 16, No. 4, 3-20 (2009). MSC: 90C35 PDF BibTeX XML Cite \textit{A. A. Ageev} and \textit{A. V. Pyatkin}, Diskretn. Anal. Issled. Oper. 16, No. 4, 3--20 (2009; Zbl 1249.90296)
Ageev, Alexander A.; Pyatkin, Artem V. A 2-approximation algorithm for the metric 2-peripatetic salesman problem. (English) Zbl 1130.90386 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 103-115 (2008). MSC: 90C27 68W25 68W40 90C35 90C59 PDF BibTeX XML Cite \textit{A. A. Ageev} and \textit{A. V. Pyatkin}, Lect. Notes Comput. Sci. 4927, 103--115 (2008; Zbl 1130.90386) Full Text: DOI