Katherine Neznakhina

From MaRDI portal
(Redirected from Person:330502)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Approximation algorithms with constant factors for a series of asymmetric routing problems
Doklady Mathematics
2024-03-19Paper
Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
Proceedings of the Steklov Institute of Mathematics
2024-02-16Paper
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
Ural mathematical journal
2023-10-05Paper
Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
Optimization and Applications
2023-08-10Paper
Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
Proceedings of the Steklov Institute of Mathematics
2023-03-09Paper
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Annals of Mathematics and Artificial Intelligence
2020-02-11Paper
Approximation schemes for the generalized traveling salesman problem
Proceedings of the Steklov Institute of Mathematics
2018-04-20Paper
Generalized pyramidal tours for the generalized traveling salesman problem2018-02-26Paper
A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension
Proceedings of the Steklov Institute of Mathematics
2017-06-08Paper
Approximability of the minimum-weight \(k\)-size cycle cover problem
Journal of Global Optimization
2016-10-26Paper
Approximation of Euclidean \(k\)-size cycle cover problem
Croatian operational research review
2015-12-11Paper
Approximability of the problem about a minimum-weight cycle cover of a graph
Doklady Mathematics
2015-08-21Paper
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
Proceedings of the Steklov Institute of Mathematics
2015-08-20Paper


Research outcomes over time


This page was built for person: Katherine Neznakhina