Pages that link to "Item:Q4972682"

The following pages link to A Lottery Model for Center-Type Problems With Outliers (Q4972682):

Displaying 11 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)
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
• Fair Colorful k-Center Clustering (Q5041747) (← links)
• (Q5214247) (← links)
• (Q5874506) (← links)
• Efficient algorithms for fair clustering with a new notion of fairness (Q6052264) (← 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)
• Fully dynamic \(k\)-center clustering with outliers (Q6185941) (← links)