Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626): Difference between revisions

@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247463
@@ Property / cites work: Q4247463 / rank @@
+Normal rank
@@ Property / cites work @@
+Paired-domination in graphs
@@ Property / cites work: Paired-domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Labelling algorithms for paired-domination problems in block and interval graphs
+Normal rank
@@ Property / cites work @@
+Paired-domination of trees
@@ Property / cites work: Paired-domination of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Paired-domination in inflated graphs
@@ Property / cites work: Paired-domination in inflated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paired domination on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for the paired-domination problem on permutation graphs
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / 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 @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3822197
@@ Property / cites work: Q3822197 / rank @@
+Normal rank