Approximation algorithms for grooming in optical network design (Q551206): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for the design of SDH/SONET networks
+Normal rank
@@ Property / cites work @@
+The SONET edge‐partition problem
@@ Property / cites work: The SONET edge‐partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Better bounds for minimizing SONET ADMs
@@ Property / cites work: Better bounds for minimizing SONET ADMs / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and approximation of traffic grooming
@@ Property / cites work: Hardness and approximation of traffic grooming / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals and Eulerian Cycle Decompositions
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921712
@@ Property / cites work: Q2921712 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for cycle packing problems
+Normal rank
@@ Property / cites work @@
+Approximability of Packing Disjoint Cycles
@@ Property / cites work: Approximability of Packing Disjoint Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern matching with address errors
@@ Property / cites work: Pattern matching with address errors / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cost of Interchange Rearrangement in Strings
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank