The following pages link to (Q3579385):
Displaying 22 items.
- Matroid and knapsack center problems (Q300451) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Local search algorithm for the spherical \(k\)-means problem with outliers (Q2039653) (← links)
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- (Q5009495) (← links)
- (Q5009501) (← links)
- (Q5075746) (← links)
- (Q5091167) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- (Q5743481) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- (Q5875489) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)
