Pages that link to "Item:Q3186508"

The following pages link to An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508):

Displayed 19 items.

• Parameterized complexity of categorical clustering with size constraints (Q832880) ‎ (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) ‎ (← links)
• An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) ‎ (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) ‎ (← links)
• Lossy kernelization of same-size clustering (Q2097218) ‎ (← links)
• To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) ‎ (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) ‎ (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) ‎ (← links)
• An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) ‎ (← links)
• An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) ‎ (← links)
• Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) ‎ (← links)
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) ‎ (← links)
• (Q5091191) ‎ (← links)
• (Q5874473) ‎ (← links)
• (Q5874534) ‎ (← links)
• (Q6084420) ‎ (← links)
• Parameterized complexity of categorical clustering with size constraints (Q6098152) ‎ (← links)
• Improved bounds for metric capacitated covering problems (Q6107884) ‎ (← links)
• Lossy kernelization of same-size clustering (Q6174654) ‎ (← links)