MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
On the approximation hardness of dense TSP and other path problems
Information Processing Letters
Approximating minimum unsatisfiability of linear equations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Non-approximability Results for Vertex Cover with Density Constraints
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
| Hi-index | 0.00 |
. We give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.