The following pages link to (Q4598206):
Displaying 24 items.
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- A weighted K-member clustering algorithm for K-anonymization (Q2244050) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
- (Q5002700) (← links)
- (Q5002778) (← links)
- (Q5009501) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- Fair Colorful k-Center Clustering (Q5041747) (← links)
- (Q5075746) (← links)
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
- (Q5874506) (← links)
- Small Space Stream Summary for Matroid Center (Q5875472) (← links)
- Robust \(k\)-center with two types of radii (Q5918429) (← links)
- (Q6062155) (← links)
- New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)