On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-53174-7_3
+Normal rank
@@ Property / OpenAlex ID @@
+W2489258616
@@ Property / OpenAlex ID: W2489258616 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On linear k-arboricity
@@ Property / cites work: On linear k-arboricity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+The regenerator location problem
@@ Property / cites work: The regenerator location problem / rank @@
+Normal rank
@@ Property / cites work @@
+Traffic partition in WDM/SONET rings to minimize SONET ADMs
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total busy time in parallel scheduling with application to optical networks
+Normal rank
@@ Property / cites work @@
+On Minimizing the Number of ADMs in a General Topology Optical Network
+Normal rank
@@ Property / cites work @@
+Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
+Normal rank
@@ Property / cites work @@
+Optimal on-line colorings for minimizing the number of ADMs in optical networks
+Normal rank
@@ Property / cites work @@
+Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
+Normal rank