Vladimir Shenmaier

According to our database, Vladimir Shenmaier authored at least 16 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension.

Vladimir Shenmaier

Optim. Lett., 2022

Linear-size universal discretization of geometric center-based problems in fixed dimensions.

Vladimir Shenmaier

J. Comb. Optim., 2022

Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics.

Vladimir Shenmaier

CoRR, 2022

Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space.

Vladimir Shenmaier

Adv. Data Anal. Classif., 2022

2021

On the Complexity of the Geometric Median Problem with Outliers.

Vladimir Shenmaier

CoRR, 2021

An Improved Approximation for Packing Big Two-Bar Charts.

Adil I. Erzin, Vladimir Shenmaier

CoRR, 2021

Approximation and Complexity of the Capacitated Geometric Median Problem.

Vladimir Shenmaier

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Complexity and algorithms for finding a subset of vectors with the longest sum.

Vladimir Shenmaier

Theor. Comput. Sci., 2020

2019

A Structural Theorem for Center-Based Clustering in High-Dimensional Euclidean Space.

Vladimir Shenmaier

Proceedings of the Machine Learning, Optimization, and Data Science, 2019

2017

Complexity and Approximation of the Longest Vector Sum Problem.

Vladimir Shenmaier

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

An Approximation Scheme for a Weighted Two-Cluster Partition Problem.

Alexander Kel'manov, Anna Motkova, Vladimir Shenmaier

Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016

An approximation algorithm for the Euclidean incremental median problem.

Vladimir Shenmaier

Discret. Optim., 2016

2015

Complexity and approximation of the Smallest k-Enclosing Ball problem.

Vladimir Shenmaier

Eur. J. Comb., 2015

2014

Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP.

V. V. Shenmaier

Discret. Appl. Math., 2014

2004

A greedy algorithm for maximizing a linear objective function.

V. V. Shenmaier

Discret. Appl. Math., 2004

2003

A greedy algorithm for some classes of integer programs.

V. V. Shenmaier

Discret. Appl. Math., 2003