Pages that link to "Item:Q4490794"

The following pages link to The Capacitated <i>K</i>-Center Problem (Q4490794):

Displaying 46 items.

• New approximation results for resource replication problems (Q270001) (← links)
• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Graph clustering (Q458448) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• A model for minimizing active processor time (Q487001) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• Client assignment problems for latency minimization (Q2424655) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• The load-distance balancing problem (Q2892142) (← links)
• Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← 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)
• (Q5136270) (← links)
• (Q5874473) (← links)
• (Q5874534) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← 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)