Complexity of majority monopoly and signed domination problems (Q414422): Difference between revisions

@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Majority domination in graphs
@@ Property / cites work: Majority domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871151
@@ Property / cites work: Q4871151 / rank @@
+Normal rank
@@ Property / cites work @@
+Signed domination in regular graphs
@@ Property / cites work: Signed domination in regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Signed domination in regular graphs and set-systems
+Normal rank
@@ Property / cites work @@
+Inequalities relating domination parameters in cubic graphs
+Normal rank
@@ Property / cites work @@
+Q4378625
@@ Property / cites work: Q4378625 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4858149
@@ Property / cites work: Q4858149 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Domination in graphs with minimum degree two
@@ Property / cites work: Domination in graphs with minimum degree two / rank @@
+Normal rank
@@ Property / cites work @@
+Q4415262
@@ Property / cites work: Q4415262 / rank @@
+Normal rank
@@ Property / cites work @@
+On the signed domination in graphs
@@ Property / cites work: On the signed domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Improved performance of the greedy algorithm for partial cover
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank