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

@@ Property / Mathematics Subject Classification ID @@
+W27
@@ Property / Mathematics Subject Classification ID: 68W27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6588277
@@ Property / zbMATH DE Number: 6588277 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+online algorithms
@@ Property / zbMATH Keywords: online algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dominating set
@@ Property / zbMATH Keywords: dominating set / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(96)00191-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2031490900
@@ Property / OpenAlex ID: W2031490900 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:290186