The following pages link to (Q5075746):
Displaying 12 items.
- 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)
- On fair covering and hitting problems (Q2672421) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- Fair Colorful k-Center Clustering (Q5041747) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Robust \(k\)-center with two types of radii (Q5918429) (← links)
- Robust \(k\)-center with two types of radii (Q5925649) (← links)
- Efficient algorithms for fair clustering with a new notion of fairness (Q6052264) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- An approximation algorithm for diversity-aware fair \(k\)-supplier problem (Q6144023) (← links)
