Structural complexity 1
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Continuous reductions among combinatorial optimization problems
Acta Informatica
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Completeness in approximation classes
Information and Computation
Introduction to the theory of complexity
Introduction to the theory of complexity
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science
Randomized algorithms
Approximate solution of NP optimization problems
Theoretical Computer Science
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Non-approximability Results for Vertex Cover with Density Constraints
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Structure in Approximation Classes (Extended Abstract)
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
On Approximation Scheme Preserving Reducability and Its Applications
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Approximation Algorithms in Combinatorial Optimization
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Schemes Using L-Reductions
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On syntactic versus computational views of approximability
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A note on the approximation of the max clique problem
Information Processing Letters
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
Local Monotonicity in Probabilistic Networks
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
On the computational complexity of the forcing chromatic number
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Survey: A survey on the structure of approximation classes
Computer Science Review
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
| Hi-index | 0.00 |
Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to the definition of several approximation preserving reducibilities and to the development of powerful reduction techniques. We first review the main approximation preserving reducibilities that have appeared in the literature and suggest which one of them should be used. Successively, we give some hints on how to prove new non-approximability results by emphasizing the most interesting techniques among the new ones that have been developed in the last few years.