Paper

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

1995

Created by ACM worker at 2019-04-10 10:27:24.0.
Last updated by ACM worker at 2019-04-12 14:38:00.0.

Simplified Graph of Associations

Word Cloud

Research Paradigm

Authors

2

Michel X. Goemans

David P. Williamson

Venue

1

Journal of the ACM

Referenced By

2

Approximating the cut-norm via Grothendieck’s inequality

A unified approach to scheduling on unrelated parallel machines