Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 679-687

  Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

APPROXIMATION ALGORITHMS; OUTWARD ROTATIONS; SEMIDEFINITE PROGRAMMING RELAXATIONS;

PROGRAMMING THEORY;

EID: 0032631766     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (18)