New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms and Hardness for Domination with Propagation
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Transitive-Closure Spanners
@@ Property / cites work: Transitive-Closure Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Label Cover Problems
+Normal rank
@@ Property / cites work @@
+Q3579502
@@ Property / cites work: Q3579502 / rank @@
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Stochastic Steiner Tree with Non-uniform Inflation
+Normal rank
@@ Property / cites work @@
+Power optimization for connectivity problems
@@ Property / cites work: Power optimization for connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating spanners
@@ Property / cites work: On the hardness of approximating spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Vertex-Connectivity Network Design Problems
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
+Normal rank