An approximation scheme for a problem of search for a vector subset
From MaRDI portal
Publication:5263769
DOI10.1134/S1990478912030131zbMath1324.90120MaRDI QIDQ5263769
No author found.
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Approximation algorithms (68W25)
Related Items (15)
Linear-size universal discretization of geometric center-based problems in fixed dimensions ⋮ Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters ⋮ Selecting a subset of diverse points based on the squared Euclidean distance ⋮ Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster ⋮ Solving some vector subset problems by Voronoi diagrams ⋮ PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem ⋮ Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space ⋮ Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation ⋮ A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets ⋮ Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems ⋮ Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions ⋮ Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space ⋮ An FPTAS for a vector subset search problem ⋮ Approximation and complexity of the capacitated geometric median problem
This page was built for publication: An approximation scheme for a problem of search for a vector subset
