Approximate solution of NP optimization problems (Q672315): Difference between revisions

@@ Property / author @@
-Giorgio Ausiello
@@ Property / author: Giorgio Ausiello / rank @@
-Normal rank
@@ Property / author @@
-Marco Protasi
@@ Property / author: Marco Protasi / rank @@
-Normal rank
@@ Property / author @@
+Giorgio Ausiello
@@ Property / author: Giorgio Ausiello / rank @@
+Normal rank
@@ Property / author @@
+Marco Protasi
@@ Property / author: Marco Protasi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Q3920645
@@ Property / cites work: Q3920645 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a unified approach for the classification of NP-complete optimization problems
+Normal rank
@@ Property / cites work @@
+Local search, reducibility and approximability of NP-optimization problems
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283229
@@ Property / cites work: Q4283229 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient probabilistically checkable proofs and applications to approximations
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4293543
@@ Property / cites work: Q4293543 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
+Normal rank
@@ Property / cites work @@
+A note on the approximation of the MAX CLIQUE problem
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
+Normal rank
@@ Property / cites work @@
+AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS
+Normal rank
@@ Property / cites work @@
+Q4470516
@@ Property / cites work: Q4470516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Polynomially bounded minimization problems which are hard to approximate
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Logical definability of NP optimization problems
@@ Property / cites work: Logical definability of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320130
@@ Property / cites work: Q3320130 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+On different approximation criteria for subset product problems
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+On Approximate Solutions for Combinatorial Optimization Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:672315