The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The Complexity of Near-Optimal Graph Coloring
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
On the Structure of Combinatorial Problems and Structure Preserving Reductions
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Planar 3-colorability is polynomial complete
ACM SIGACT News
The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A taxonomy of proof systems (part 1)
ACM SIGACT News
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
A taxonomy of proof systems (part 2)
ACM SIGACT News
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
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
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximately counting up to four (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Register allocation in structured programs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Parallel processor scheduling with delay constraints
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of join predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Inapproximability Results for Guarding Polygons without Holes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity
Random Structures & Algorithms
On the partial terminal Steiner tree problem
The Journal of Supercomputing
A better list heuristic for vertex cover
Information Processing Letters
Orientation matters: how to efficiently solve ocst problems with problem-specific EAs
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
New insights into the OCST problem: integrating node degrees and their location in the graph
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
A note on the approximation of the max clique problem
Information Processing Letters
On the internal steiner tree problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Online multicasting in WDM networks with shared light splitter bank
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
A lower bound on approximation algorithms for the closest substring problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Optimizing restriction site placement for synthetic genomes
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Resolving the complexity of some data privacy problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Cryptography in constant parallel time
Cryptography in constant parallel time
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Optimizing restriction site placement for synthetic genomes
Information and Computation
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in fact contain several natural, well-studied ones. We show that problems in these classes can be approximated with some bounded error. Furthermore, we show that a number of common optimization problems are complete under a kind of careful transformation (called L-reduction) that preserves approximability. It follows that such a complete problem has a polynomial-time approximation scheme iff the whole class does. These results may help explain the lack of progress on the approximability of a host of optimization problems.