On-line algorithms for the dominating set problem (Q290186): Difference between revisions

@@ Property / cites work @@
+Finding a minimum independent dominating set in a permutation graph
+Normal rank
@@ Property / cites work @@
+The greedy algorithm is optimal for on-line edge coloring
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive algorithms for server problems
@@ Property / cites work: Competitive algorithms for server problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
+Normal rank