Approximability and inapproximability of the minimum certificate dispersal problem (Q982648): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.03.029
+Normal rank
@@ Property / OpenAlex ID @@
+W1982007160
@@ Property / OpenAlex ID: W1982007160 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Dispersal of Certificate Chains
@@ Property / cites work: Optimal Dispersal of Certificate Chains / rank @@
+Normal rank
@@ Property / cites work @@
+Stabilizing Certificate Dispersal
@@ Property / cites work: Stabilizing Certificate Dispersal / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Provisioning a virtual private network
@@ Property / cites work: Provisioning a virtual private network / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549729
@@ Property / cites work: Q3549729 / rank @@
+Normal rank