An approximation scheme for a problem of search for a vector subset
From MaRDI portal
Publication:5263769
Recommendations
- An FPTAS for a vector subset search problem
- An approximation algorithm for solving the problem of the search of a subset of vectors
- Efficient randomized algorithm for a vector subset problem
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- A 2-approximation polynomial algorithm for a clustering problem
Cited in
(20)- Easy NP-hardness Proofs of Some Subset Choice Problems
- LATIN 2004: Theoretical Informatics
- Approximation and complexity of the capacitated geometric median problem
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Search problems in vector spaces
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- An FPTAS for a vector subset search problem
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
- Selecting a subset of diverse points based on the squared Euclidean distance
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- PTAS for problems of vector choice and clustering with different centers
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
- Efficient randomized algorithm for a vector subset problem
- Solving some vector subset problems by Voronoi diagrams
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
This page was built for publication: An approximation scheme for a problem of search for a vector subset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263769)
