Pages that link to "Item:Q896276"

The following pages link to Centrality of trees for capacitated \(k\)-center (Q896276):

Displaying 27 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
• The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
• (Q5002778) (← links)
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
• The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• (Q5874473) (← links)
• (Q6084420) (← links)
• Improved bounds for metric capacitated covering problems (Q6107884) (← links)
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• Massively parallel and streaming algorithms for balanced clustering (Q6144020) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• The fair \(k\)-center with outliers problem: FPT and polynomial approximations (Q6535817) (← links)
• Bike rebalancing: how to find a balanced matching in the k center problem? (Q6565428) (← links)
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← 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)
• FPT approximation for capacitated clustering with outliers (Q6658317) (← links)