Pages that link to "Item:Q5264739"
From MaRDI portal
The following pages link to An FPTAS for a vector subset search problem (Q5264739):
Displaying 13 items.
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← 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)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
