Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Katherine Neznakhina
Institution:
N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
Observed institutions:
Ural Federal University,
Omsk State Technical University,
N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences,
Ural Branch of the Russian Academy of Sciences
ORCID:
0000-0002-2122-0446
Observed ORCID:
0000-0002-2122-0446
OpenAlex ID:
A5083360366
Approximability of the minimum-weight k-size cycle cover problem
2015
·
Michael Khachay
, Katherine Neznakhina
·
Journal of Global Optimization
·
59
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
2019
·
Michael Khachay
, Katherine Neznakhina
·
Annals of Mathematics and Artificial Intelligence
·
21
Towards Tractability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters Defined by a Grid of Bounded Height
2018
·
Michael Khachay
, Katherine Neznakhina
·
Communications in computer and information science
·
13
Towards a PTAS for the generalized TSP in grid clusters
2016
·
Michael Khachay
, Katherine Neznakhina
·
AIP conference proceedings
·
8
Fixed Ratio Polynomial Time Approximation Algorithm for the Prize-collecting Asymmetric Traveling Salesman Problem
2023
·
Ksenia Rizhenko
, Katherine Neznakhina
, et al.
·
Ural mathematical journal
·
6
Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters
2017
·
Michael Khachay
, Katherine Neznakhina
·
Lecture notes in computer science
·
6
Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension
2016
·
Michael Khachay
, Katherine Neznakhina
·
IFAC-PapersOnLine
·
5
Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem
2017
·
Michael Khachay
, Katherine Neznakhina
·
Lecture notes in computer science
·
4
Approximation Algorithms for Generalized TSP in Grid Clusters.
2016
·
Michael Khachay
, Katherine Neznakhina
·
4
Approximation of Euclidean k-size cycle cover problem
2014
·
Michael Khachay
, Katherine Neznakhina
·
Croatian Operational Research Review
·
3
PDF
Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters
2018
·
Michael Khachay
, Katherine Neznakhina
·
Lecture notes in computer science
·
1
Implementation and Numerical Evaluation of Traub and Vygen Algorithm for the Subtour Cover Problem
2026
·
Ksenia Rizhenko
, Daniil Khachai
, et al.
·
Lecture notes in computer science
Fixed-Ratio Approximation Algorithm for the Minimum Cost Cover of a Digraph by Bounded Number of Cycles
2024
·
Daniil Khachai
, Katherine Neznakhina
, et al.
·
WSEAS Transactions on Computers archive
PDF
Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio
2022
·
Michael Khachay
, Katherine Neznakhina
, et al.
·
Lecture notes in computer science
Show more works
View as search
Works count:
14
Citation count:
130
H-index:
6
I10-index:
3
Year
Topic
Type