Katherine Neznakhina

According to our database, Katherine Neznakhina authored at least 7 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio.

Mikhail Yu. Khachay, Katherine Neznakhina, Ksenia Rizhenko

Proceedings of the Optimization and Applications - 13th International Conference, 2022

2020

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters.

Michael Yu. Khachay, Katherine Neznakhina

Ann. Math. Artif. Intell., 2020

2018

Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters.

Michael Yu. Khachay, Katherine Neznakhina

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017

Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem.

Michael Yu. Khachay, Katherine Neznakhina

Proceedings of the Combinatorial Optimization and Applications, 2017

Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters.

Michael Yu. Khachay, Katherine Neznakhina

Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016

Approximability of the minimum-weight k-size cycle cover problem.

Michael Yu. Khachay, Katherine Neznakhina

J. Glob. Optim., 2016

Approximation Algorithms for Generalized TSP in Grid Clusters.

Michael Yu. Khachay, Katherine Neznakhina

Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016