( en | de | ru )

 

Disambiguation of "Khandeev, Vladimir I."

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Algorithms for Some Sequence Clustering Problems.

, , and . LION, volume 12096 of Lecture Notes in Computer Science, page 96-101. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vladimir Miloj i

Vladimir Bo i kovi

Nata i i

imun Ko i i

Vladimir Dyakonov

 

Other publications of authors with the same name

Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case., and . AIST, volume 11832 of Lecture Notes in Computer Science, page 377-387. Springer, (2019)Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence., , , and . Ann. Math. Artif. Intell., 88 (1-3): 157-168 (2020)Randomized Algorithms for Some Sequence Clustering Problems., , and . LION, volume 12096 of Lecture Notes in Computer Science, page 96-101. Springer, (2020)Exact pseudopolynomial algorithm for one sequence partitioning problem., , and . Autom. Remote. Control., 78 (1): 67-74 (2017)Max-Min Problems of Searching for Two Disjoint Subsets., and . OPTIMA, volume 13078 of Lecture Notes in Computer Science, page 231-245. Springer, (2021)Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation.. NUMTA (2), volume 11974 of Lecture Notes in Computer Science, page 400-405. Springer, (2019)Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case., and . NUMTA (2), volume 11974 of Lecture Notes in Computer Science, page 394-399. Springer, (2019)The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension., and . MOTOR (2), volume 1090 of Communications in Computer and Information Science, page 207-216. Springer, (2019)Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence., , , and . LION, volume 11353 of Lecture Notes in Computer Science, page 326-336. Springer, (2018)On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line., and . LION, volume 11968 of Lecture Notes in Computer Science, page 46-52. Springer, (2019)