Pages that link to "Item:Q5041734"

The following pages link to A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734):

Displaying 11 items.

• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• Fair colorful \(k\)-center clustering (Q2118132) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• On fair covering and hitting problems (Q2672421) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• Computing and Combinatorics (Q4681195) (← links)
• (Q5136270) (← 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)