Paper

Random sampling and approximation of MAX-CSP problems

2002

Created by Alysson Bolognesi Prado at 2019-03-28 10:12:40.0.
Last updated by ACM worker at 2019-04-10 10:27:07.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

4

W. Fernandez de la Vega

Marek Karpinski

Venue

1

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02

References

4

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

.879-approximation algorithms for MAX CUT and MAX 2SAT

Property testing and its connection to learning and approximation

A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

Referenced By

2

Sampling from large matrices

Approximating the cut-norm via Grothendieck’s inequality