Using complex semidefinite programming for approximating MAX E2-LIN3

DOI10.1007/3-540-44666-4_1MaRDI QIDQ4780776zbMATH OpenFDO

Authors Michel X. Goemans

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290001

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
• On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Cited in

(3)

• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• A new way of using semidefinite programming with applications to linear equations mod p
• scientific article; zbMATH DE number 1305390 (Why is no real title available?)

This page was built for publication: Using complex semidefinite programming for approximating MAX E2-LIN3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780776)