Comparing first-fit and next-fit for online edge coloring (Q964390): Difference between revisions

@@ Property / cites work @@
+On-line edge-coloring with a fixed number of colors
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy algorithm is optimal for on-line edge coloring
+Normal rank
@@ Property / cites work @@
+The relative worst-order ratio applied to paging
@@ Property / cites work: The relative worst-order ratio applied to paging / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
+Normal rank
@@ Property / cites work @@
+The relative worst order ratio for online algorithms
+Normal rank
@@ Property / cites work @@
+Separating online scheduling algorithms with the relative worst order ratio
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+A new measure for the study of on-line algorithms
@@ Property / cites work: A new measure for the study of on-line algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875207
@@ Property / cites work: Q4875207 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit constructions of linear-sized superconcentrators
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank