The fault-tolerant capacitated \(K\)-center problem (Q484314): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M15
@@ Property / Mathematics Subject Classification ID: 68M15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B80
@@ Property / Mathematics Subject Classification ID: 90B80 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6383894
@@ Property / zbMATH DE Number: 6383894 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+capacitated \(K\)-center problem
@@ Property / zbMATH Keywords: capacitated \(K\)-center problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fault tolerance
@@ Property / zbMATH Keywords: fault tolerance / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2014.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2178005013
@@ Property / OpenAlex ID: W2178005013 / rank @@
+Normal rank
@@ Property / cites work @@
+Centrality of Trees for Capacitated k-Center
@@ Property / cites work: Centrality of Trees for Capacitated k-Center / rank @@
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized submodular cover problems and applications
+Normal rank
@@ Property / cites work @@
+A simple heuristic for the p-centre problem
@@ Property / cites work: A simple heuristic for the p-centre problem / rank @@
+Normal rank
@@ Property / cites work @@
+Bottleneck extrema
@@ Property / cites work: Bottleneck extrema / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+Easy and hard bottleneck location problems
@@ Property / cites work: Easy and hard bottleneck location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fault tolerant \(K\)-center problems
@@ Property / cites work: Fault tolerant \(K\)-center problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for the p-center problem in graphs
@@ Property / cites work: A heuristic for the p-center problem in graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:484314