Pages that link to "Item:Q5263825"
From MaRDI portal
The following pages link to A 2-approximation polynomial algorithm for a clustering problem (Q5263825):
Displayed 9 items.
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← 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)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem (Q6134053) (← links)