Pages that link to "Item:Q2218871"
From MaRDI portal
The following pages link to A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871):
Displaying 7 items.
- Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358) (← links)
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
- Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
- A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)
