default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Shenmaier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Vladimir Shenmaier
:
Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space. Adv. Data Anal. Classif. 16(4): 1039-1067 (2022)- [j8]Vladimir Shenmaier:
Linear-size universal discretization of geometric center-based problems in fixed dimensions. J. Comb. Optim. 43(3): 528-542 (2022) - [j7]Vladimir Shenmaier:
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension. Optim. Lett. 16(7): 2115-2122 (2022) - [i5]Vladimir Shenmaier:
Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics. CoRR abs/2201.03813 (2022) - 2021
- [c5]Vladimir Shenmaier:
Approximation and Complexity of the Capacitated Geometric Median Problem. CSR 2021: 422-434 - [i4]Adil I. Erzin, Vladimir Shenmaier:
An Improved Approximation for Packing Big Two-Bar Charts. CoRR abs/2101.00470 (2021) - [i3]Vladimir Shenmaier:
Linear-Size Universal Discretization of Geometric Center-Based Problems in Fixed Dimensions. CoRR abs/2108.10900 (2021) - [i2]Vladimir Shenmaier:
On the Complexity of the Geometric Median Problem with Outliers. CoRR abs/2112.00519 (2021) - 2020
- [j6]Vladimir Shenmaier:
Complexity and algorithms for finding a subset of vectors with the longest sum. Theor. Comput. Sci. 818: 60-73 (2020) - [i1]Vladimir Shenmaier:
Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension. CoRR abs/2012.08379 (2020)
2010 – 2019
- 2019
- [c4]Vladimir Shenmaier:
A Structural Theorem for Center-Based Clustering in High-Dimensional Euclidean Space. LOD 2019: 284-295 - 2017
- [c3]Alexander Kel'manov, Anna Motkova, Vladimir Shenmaier:
An Approximation Scheme for a Weighted Two-Cluster Partition Problem. AIST 2017: 323-333 - [c2]Vladimir Shenmaier:
Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum. COCOON 2017: 469-480 - [c1]Vladimir Shenmaier:
Complexity and Approximation of the Longest Vector Sum Problem. WAOA 2017: 41-51 - 2016
- [j5]Vladimir Shenmaier:
An approximation algorithm for the Euclidean incremental median problem. Discret. Optim. 22: 312-327 (2016) - 2015
- [j4]Vladimir Shenmaier:
Complexity and approximation of the Smallest k-Enclosing Ball problem. Eur. J. Comb. 48: 81-87 (2015) - 2014
- [j3]V. V. Shenmaier:
Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP. Discret. Appl. Math. 163: 214-219 (2014)
2000 – 2009
- 2004
- [j2]V. V. Shenmaier:
A greedy algorithm for maximizing a linear objective function. Discret. Appl. Math. 135(1-3): 267-279 (2004) - 2003
- [j1]V. V. Shenmaier:
A greedy algorithm for some classes of integer programs. Discret. Appl. Math. 133(1-3): 93-101 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
