The following pages link to How to Allocate Network Centers (Q4275335):
Displaying 50 items.
- New approximation results for resource replication problems (Q270001) (← 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)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Compact location problems (Q1391322) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← 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 distributed algorithm to find \(k\)-dominating sets (Q1827867) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Donation center location problem (Q1949758) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Minimax models for capacitated \(p\)-center problem in uncertain environment (Q2052930) (← links)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← 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)
- Approximability results for the converse connected<i>p</i>-centre problem<sup>†</sup> (Q2958261) (← links)
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
- ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM (Q3007757) (← links)
- Statistical mechanics of the directed 2-distance minimal dominating set problem (Q3386942) (← 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)
- Facility location with dynamic distance functions (Q5054838) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- (Q5874473) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← 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)
