I. A. Rykov

Available identifiers

Publication	Date of Publication	Type
On PTAS for the geometric maximum connected \(k\)-factor problem	2021-09-14	Paper
On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space	2021-04-19	Paper
Efficient Randomized Algorithm for a Vector Subset Problem	2018-02-13	Paper
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles	2017-06-08	Paper
A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum	2016-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q5741365	2016-07-22	Paper
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight	2016-06-16	Paper
Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above	2015-08-20	Paper
On the m-capacitated peripatetic salesman problem with capacity restrictions	2015-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q3115696	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3115710	2012-02-10	Paper
On a comparison between the strip packing problem and a scheduling problem	2012-02-10	Paper
Approaches to solving RCPSP using relaxed problem with consumable resources	2011-04-07	Paper
Polynomial approximation algorithms for solving resource-constrained project scheduling problem	2007-05-29	Paper

This page was built for person: I. A. Rykov