The approximation of maximum subgraph problems (Q4630247): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-56939-1_60
+Normal rank
@@ Property / OpenAlex ID @@
+W1563577400
@@ Property / OpenAlex ID: W1563577400 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Constructions of Almost k-wise Independent Random Variables
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient probabilistically checkable proofs and applications to approximations
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5629667
@@ Property / cites work: Q5629667 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fully parallelized multi-prover protocols for NEXP-time
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Planar graphs: Theory and algorithms
@@ Property / cites work: Planar graphs: Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+On Approximate Solutions for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank