Inapproximability and approximability of maximal tree routing and coloring (Q2498986): Difference between revisions

@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Algorithmic Applications in Management
@@ Property / cites work: Algorithmic Applications in Management / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing algorithm for multicast under multi-tree model in optical networks
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4231910
@@ Property / cites work: Q4231910 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfying a maximum number of pre-routed requests in all-optical rings.
+Normal rank
@@ Property / cites work @@
+Q4952699
@@ Property / cites work: Q4952699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250415
@@ Property / cites work: Q4250415 / rank @@
+Normal rank