How to Allocate Network Centers
From MaRDI portal
Recommendations
- Cluster allocation design networks
- Allocation strategies in hub networks
- Allocation rules on networks
- scientific article; zbMATH DE number 177560
- Sharing the cost of a network: core and core allocations
- Allocating data and workload among multiple servers in a local area network
- Network location of a reliable center using the most reliable route policy
- Structure connectivity of data center networks
Cited in
(61)- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- Compact location problems
- Fault tolerant \(K\)-center problems
- Generalized submodular cover problems and applications
- k-balanced center location problem: a new multi-objective facility location problem
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
- \(k\)-center problems with minimum coverage
- A distributed algorithm to find \(k\)-dominating sets
- A constant-factor approximation algorithm for the k-median problem
- Donation center location problem
- Faster balanced clusterings in high dimension
- Minimax models for capacitated p-center problem in uncertain environment
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor
- Capacitated covering problems in geometric spaces
- An adaptive probabilistic algorithm for online \(k\)-center clustering
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- A PTAS for the cardinality constrained covering with unit balls
- An exact algorithm for the capacitated vertex \(p\)-center problem
- Tight FPT approximation for constrained k-center and k-supplier
- New approximation results for resource replication problems
- The load-distance balancing problem
- Approximability results for the converse connected p-centre problem
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- Algorithms for minimum connected capacitated dominating set problem
- Capacitated p-center problem with failure foresight
- When centers can fail: a close second opportunity
- Statistical mechanics of the directed 2-distance minimal dominating set problem
- scientific article; zbMATH DE number 177560 (Why is no real title available?)
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Graph clustering
- The fault-tolerant capacitated \(K\)-center problem
- The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
- Privacy preserving clustering with constraints
- Facility location with dynamic distance functions
- Capacitated covering problems in geometric spaces
- An efficient distributed algorithm for constructing small dominating sets
- scientific article; zbMATH DE number 4193445 (Why is no real title available?)
- On capacitated covering with unit balls
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- scientific article; zbMATH DE number 7651148 (Why is no real title available?)
- On the cost of essentially fair clusterings
- Approximability results for the $p$-centdian and the converse centdian problems
- A Survey of the Generalized Assignment Problem and Its Applications
- Improved bounds for metric capacitated covering problems
- New algorithms for fair \(k\)-center problem with outliers and capacity constraints
- Distributed approximation of capacitated dominating sets
- Massively parallel and streaming algorithms for balanced clustering
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- Bike rebalancing: how to find a balanced matching in the k center problem?
- The parameterized complexity of terminal monitoring set
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- Variants of Euclidean k-center clusterings
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
- Randomized approximation of bounded multicovering problems
- A fixed-parameter tractable approximation for capacitated k-supplier
- Moderate dimension reduction for k-center clustering
- An improved approximation algorithm for the k-supplier problem with parameterized triangle inequality
- An improved two-stage approximation algorithm for the k-supplier problem with parameterized triangle inequality
- Optimal broadcast domination in polynomial time
- Centrality of trees for capacitated \(k\)-center
This page was built for publication: How to Allocate Network Centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275335)
