The following pages link to Clustering with Diversity (Q3587379):
Displaying 10 items.
- Matroid and knapsack center problems (Q300451) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems (Q2185527) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- (Q5002778) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)
