The following pages link to Katherine Neznakhina (Q330502):
Displaying 12 items.
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- (Q492281) (redirect page) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
- Generalized pyramidal tours for the generalized traveling salesman problem (Q1699787) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
