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

From Wikidata
Jump to navigation Jump to search
scholarly article by Michel Goemans & David P. Williamson published 1 November 1995 in Journal of the ACM
edit
Language Label Description Also known as
English
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
scholarly article by Michel Goemans & David P. Williamson published 1 November 1995 in Journal of the ACM

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    edit