Katherine Neznakhina

Available identifiers

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

This page was built for person: Katherine Neznakhina