Average competitive ratios of on-line spanning trees (Q287071): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W27
@@ Property / Mathematics Subject Classification ID: 68W27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6585414
@@ Property / zbMATH DE Number: 6585414 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+analysis of algorithms
@@ Property / zbMATH Keywords: analysis of algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+average-case analysis
@@ Property / zbMATH Keywords: average-case analysis / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+competitive ratios
@@ Property / zbMATH Keywords: competitive ratios / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum spanning trees
@@ Property / zbMATH Keywords: minimum spanning trees / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Steiner Tree Problem
@@ Property / cites work: Dynamic Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:287071