Solving some vector subset problems by Voronoi diagrams

We propose a general approach to solving some vector subset problems in a Euclidean space that is based on higher-order Voronoi diagrams. In the case of a fixed space dimension, this approach allows us to find optimal solutions to these problems in polynomial time which is better than the runtime of available algorithms.

[1]  V. V. Shenmaier,et al.  An approximation scheme for a problem of search for a vector subset , 2012 .

[2]  V. V. Shenmaier,et al.  Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters , 2016 .

[3]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[4]  A. V. Pyatkin,et al.  On a version of the problem of choosing a vector subset , 2009 .

[5]  Franco P. Preparata,et al.  The Densest Hemisphere Problem , 1978, Theor. Comput. Sci..

[6]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[7]  A. V. Pyatkin,et al.  On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension , 2010 .

[8]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  The problem of finding a subset of vectors with the maximum total weight , 2008 .

[10]  Alok Aggarwal,et al.  Finding k Points with Minimum Diameter and Related Problems , 1991, J. Algorithms.

[11]  A. V. Pyatkin,et al.  NP-completeness of some problems of choosing a vector subset , 2011 .

[12]  Polynomial algorithms for solving the vector sum problem , 2007 .

[13]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[14]  A. V. Kel’manov,et al.  An approximation algorithm for solving a problem of cluster analysis , 2011 .

[15]  A. Kel'manov,et al.  An FPTAS for a vector subset search problem , 2014 .