A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773): Difference between revisions

@@ Property / cites work @@
+Q4537730
@@ Property / cites work: Q4537730 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric             <i>k</i>             -center is log             <sup>*</sup>             <i>n</i>             -hard to approximate
+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 @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+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 @@
+Fault tolerant \(K\)-center problems
@@ Property / cites work: Fault tolerant \(K\)-center problems / rank @@
+Normal rank
@@ Property / cites work @@
+AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank