Hardness and Approximation of Traffic Grooming (Q5387787): Difference between revisions

@@ Property / OpenAlex ID @@
+W1506994020
@@ Property / OpenAlex ID: W1506994020 / 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 @@
+The ring grooming problem
@@ Property / cites work: The ring grooming problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Traffic Grooming Problem in Optical Networks
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank