Online Dual Edge Coloring of Paths and Trees (Q3453294): Difference between revisions

@@ Property / author @@
+Lene Monrad Favrholdt
@@ Property / author: Lene Monrad Favrholdt / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-18263-6_16
+Normal rank
@@ Property / OpenAlex ID @@
+W1825079874
@@ Property / OpenAlex ID: W1825079874 / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy algorithm is optimal for on-line edge coloring
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative worst order ratio for online algorithms
+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 @@
+Approximating maximum edge 2-coloring in simple graphs
+Normal rank
@@ Property / cites work @@
+Comparing first-fit and next-fit for online edge coloring
+Normal rank
@@ Property / cites work @@
+On-line edge-coloring with a fixed number of colors
+Normal rank
@@ Property / cites work @@
+Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum 2- and 3-edge-colorable subgraph problems
+Normal rank
@@ Property / cites work @@
+Approximating the maximum 3-edge-colorable subgraph problem
+Normal rank