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
MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
It is proved that everywhere-dense Min 2SAT and everywhere- dense MIN EQ both have polynomial time approximation schemes.