Pages that link to "Item:Q5263769"
From MaRDI portal
The following pages link to An approximation scheme for a problem of search for a vector subset (Q5263769):
Displaying 15 items.
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation (Q5122318) (← links)
- An FPTAS for a vector subset search problem (Q5264739) (← links)
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
- PTAS for problems of vector choice and clustering with different centers (Q6644072) (← links)
