A greedy algorithm for some classes of integer programs. - V. V. Shenmaier (Discret. Appl. Math., 2003)

A greedy algorithm for maximizing a linear objective function. - V. V. Shenmaier (Discret. Appl. Math., 2004)

Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP. - V. V. Shenmaier (Discret. Appl. Math., 2014)

Complexity and approximation of the Smallest k-Enclosing Ball problem. - Vladimir Shenmaier (Eur. J. Comb., 2015)

An approximation algorithm for the Euclidean incremental median problem. - Vladimir Shenmaier (Discret. Optim., 2016)

An Approximation Scheme for a Weighted Two-Cluster Partition Problem. - Alexander Kel'manov; Anna Motkova; Vladimir Shenmaier (AIST, 2017)

Complexity and Approximation of the Longest Vector Sum Problem. - Vladimir Shenmaier (WAOA, 2017)

A Structural Theorem for Center-Based Clustering in High-Dimensional Euclidean Space. - Vladimir Shenmaier (LOD, 2019)

Complexity and algorithms for finding a subset of vectors with the longest sum. - Vladimir Shenmaier (Theor. Comput. Sci., 2020)

Approximation and Complexity of the Capacitated Geometric Median Problem. - Vladimir Shenmaier (CSR, 2021)

An Improved Approximation for Packing Big Two-Bar Charts. - Adil I. Erzin; Vladimir Shenmaier (CoRR, 2021)

On the Complexity of the Geometric Median Problem with Outliers. - Vladimir Shenmaier (CoRR, 2021)

Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space. - Vladimir Shenmaier (Adv. Data Anal. Classif., 2022)

Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics. - Vladimir Shenmaier (CoRR, 2022)

Linear-size universal discretization of geometric center-based problems in fixed dimensions. - Vladimir Shenmaier (J. Comb. Optim., 2022)

Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension. - Vladimir Shenmaier (Optim. Lett., 2022)