Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q4369893): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank

Revision as of 21:53, 29 February 2024

scientific article; zbMATH DE number 1103557
Language Label Description Also known as
English
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
scientific article; zbMATH DE number 1103557

    Statements

    Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (English)
    0 references
    0 references
    0 references
    28 January 1998
    0 references
    randomized approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references