Pages that link to "Item:Q2261720"
From MaRDI portal
The following pages link to Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720):
Displaying 7 items.
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← 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)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- An FPTAS for a vector subset search problem (Q5264739) (← links)
