Pages that link to "Item:Q463361"
From MaRDI portal
The following pages link to A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361):
Displaying 6 items.
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- (Q3830417) (← links)
- PTAS for problems of vector choice and clustering with different centers (Q6644072) (← links)