Pages that link to "Item:Q4598208"

The following pages link to Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers (Q4598208):

Displaying 12 items.

• Faster balanced clusterings in high dimension (Q2006774) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• (Q5002778) (← links)
• (Q5009501) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• The fair \(k\)-center with outliers problem: FPT and polynomial approximations (Q6535817) (← links)
• Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
• Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)
• Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem (Q6636095) (← links)
• The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space (Q6658308) (← links)