Pages that link to "Item:Q378101"

The following pages link to A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101):

Displaying 18 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
• Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
• Respecting lower bounds in uniform lower and upper bounded facility location problem (Q2695314) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• (Q5002778) (← links)
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
• (Q5874473) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
• Improved bounds for metric capacitated covering problems (Q6107884) (← links)