The following pages link to (Q5091192):
Displaying 17 items.
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
- (Q5091191) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- Improved approximations for Euclidean <i>k</i> -means and <i>k</i> -median, via nested quasi-independent sets (Q6083617) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
- Tight FPT approximation for socially fair clustering (Q6161442) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method (Q6595781) (← links)
- FPT approximation for capacitated clustering with outliers (Q6658317) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)
- Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)
