Structure in approximation classes

This publication has 18 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• On syntactic versus computational views of approximability
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Approximation properties of NP minimization classes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Strong lower bounds on the approximability of some NPO PB-complete maximization problems
  Published by Springer Nature ,1995
• On the complexity of approximating the independent set problem
  Information and Computation, 1992
• Proof verification and hardness of approximation problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Completeness in approximation classes
  Information and Computation, 1991
• The complexity of optimization problems
  Journal of Computer and System Sciences, 1988
• An efficient approximation scheme for the one-dimensional bin-packing problem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• The NP-Completeness of Edge-Coloring
  SIAM Journal on Computing, 1981