Approximating the traffic grooming problem (Q1018099): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2007.09.001
@@ Property / DOI: 10.1016/j.jda.2007.09.001 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2007.09.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2007087349
@@ Property / OpenAlex ID: W2007087349 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The SONET edge‐partition problem
@@ Property / cites work: The SONET edge‐partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4946041
@@ Property / cites work: Q4946041 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Traffic Grooming Problem in Optical Networks
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2007.09.001
@@ Property / DOI: 10.1016/J.JDA.2007.09.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1018099