Pages that link to "Item:Q2424715"
From MaRDI portal
The following pages link to Improved PTAS for the constrained \(k\)-means problem (Q2424715):
Displayed 4 items.
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)