On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112): Difference between revisions

@@ Property / cites work @@
+Privacy, additional information and communication
@@ Property / cites work: Privacy, additional information and communication / rank @@
+Normal rank
@@ Property / cites work @@
+On communication protocols that compute almost privately
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Differential Privacy
@@ Property / cites work: Differential Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Privacy and Communication Complexity
@@ Property / cites work: Privacy and Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-metric antidimension: a privacy measure for social graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs
+Normal rank