Pages that link to "Item:Q1135201"

The following pages link to Easy and hard bottleneck location problems (Q1135201):

Displaying 9 items.

• Stateless Information Dissemination Algorithms (Q5100958) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• Small Space Stream Summary for Matroid Center (Q5875472) (← links)
• Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
• Clustering with faulty centers (Q6092308) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• Approximating the probabilistic \(p\)-center problem under pressure (Q6621850) (← links)
• Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)
• The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space (Q6658308) (← links)