Polynomial time approximation schemes for some dense instances of NP-hard optimization problems

This publication has 23 references indexed in Scilit:

• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The regularity lemma and approximation schemes for dense problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• MAX-CUT has a randomized approximation scheme in dense graphs
  Random Structures & Algorithms, 1996
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
  Random Structures & Algorithms, 1995
• Polynomial time approximation schemes for dense instances of NP-hard problems
  Published by Association for Computing Machinery (ACM) ,1995
• Proof verification and hardness of approximation problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• The Steiner problem with edge lengths 1 and 2
  Information Processing Letters, 1989
• The bandwidth problem for graphs and matrices—a survey
  Journal of Graph Theory, 1982
• Bin packing can be solved within 1 + ε in linear time
  Combinatorica, 1981
• Complexity Results for Bandwidth Minimization
  SIAM Journal on Applied Mathematics, 1978