| 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 |
| Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm | 2023-07-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 |
| PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem | 2023-01-25 | Paper |
| Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension | 2021-11-11 | Paper |
| Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand | 2021-09-14 | Paper |
| Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension | 2021-08-24 | Paper |
| Efficient approximation of the metric CVRP in spaces of fixed doubling dimension | 2021-08-17 | Paper |
| Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows | 2021-05-18 | Paper |
| An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension | 2021-04-19 | Paper |
| Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows | 2020-06-05 | Paper |
| Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand | 2020-05-19 | Paper |
| Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters | 2020-02-11 | Paper |
| Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] | 2019-12-03 | Paper |
| ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE | 2018-08-17 | 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 |
| PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$ | 2018-02-13 | Paper |
| Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces | 2017-10-27 | Paper |
| Approximability of the minimum-weight \(k\)-size cycle cover problem | 2016-10-26 | Paper |
| Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem | 2016-02-05 | Paper |
| Approximation of Euclidean k-size cycle cover problem | 2015-12-11 | Paper |
| Committee polyhedral separability: complexity and polynomial approximation | 2015-11-10 | Paper |
| Approximability of the problem about a minimum-weight cycle cover of a graph | 2015-08-21 | Paper |
| Ivan Ivanovich Eremin (January 22, 1933 -- July 21, 2013) | 2015-08-20 | Paper |
| Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph | 2015-08-20 | Paper |
| A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph | 2015-08-20 | Paper |
| Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities | 2015-03-13 | Paper |
| 2-approximation algorithm for finding a clique with minimum weight of vertices and edges | 2014-12-17 | Paper |
| The computational complexity and approximability of a series of geometric covering problems | 2014-12-16 | Paper |
| Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms | 2014-10-16 | Paper |
| Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning | 2011-11-02 | Paper |
| Sigma-compactness of metric Boolean algebras and uniform convergence of frequencies to probabilities | 2011-11-02 | Paper |
| Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules | 2010-09-24 | Paper |
| Combinatorial optimization problems related to the committee polyhedral separability of finite sets | 2009-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395298 | 2009-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5325265 | 2009-08-08 | Paper |
| Computational complexity of the minimum committee problem and related problems | 2009-03-09 | Paper |
| On the computational complexity of the minimum committee problem | 2008-06-11 | Paper |
| Parallel computations and committee constructions | 2007-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5754127 | 2007-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3440943 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3440997 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5316965 | 2005-09-15 | Paper |
| Committees of systems of linear inequalities | 2005-06-17 | Paper |
| On a relation associated with decision making by majority voting. | 2004-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451583 | 2004-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4441581 | 2004-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736216 | 2001-08-29 | Paper |
| On the existence of majority committee | 2001-08-14 | Paper |
| Estimate of the number of members in the minimal committee of a system of linear inequalities | 2000-07-04 | Paper |
