Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth 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
Completeness in Approximation Classes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
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
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth 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
Master-Slave Strategy and Polynomial Approximation
Computational Optimization and Applications
Attraction radii in binary hopfield nets are hard to compute
Neural Computation
A note on the approximation of the max clique problem
Information Processing Letters
| Hi-index | 0.00 |