Pages that link to "Item:Q5041734"
From MaRDI portal
The following pages link to A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734):
Displaying 8 items.
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- On fair covering and hitting problems (Q2672421) (← 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)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)
- A parameterized approximation scheme for generalized partial vertex cover (Q6138992) (← links)