2 citations · 3 across the 5 of their papers we have counts for
5 papers
Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics
Vladimir Shenmaier
The maximum traveling salesman problem (Max~TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. We prove tha…
On the Complexity of the Geometric Median Problem with Outliers
Vladimir Shenmaier
In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center)…
Linear-Size Universal Discretization of Geometric Center-Based Problems in Fixed Dimensions
Vladimir Shenmaier
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the cente…
An Improved Approximation for Packing Big Two-Bar Charts
Adil Erzin, Vladimir Shenmaier
Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem…
Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension
Vladimir Shenmaier
The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. This problem…