Pages that link to "Item:Q2396371"
From MaRDI portal
The following pages link to Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371):
Displaying 11 items.
- Two-way and multiway partitioning of a set of intervals for clique-width maximization (Q1283929) (← links)
- A PTAS for the \(k\)-consensus structures problem under squared Euclidean distance (Q1662431) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← 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)
- 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)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
- PTAS for problems of vector choice and clustering with different centers (Q6644072) (← links)
