Positive semidefinite programming: mixed, parallel, and width-independent

DOI10.1145/3357713.3384338MaRDI QIDQ5144965zbMATH OpenOpenAlexWikidataFDO

Authors Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, Kevin T. Tian

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.04830

zbMATH Keywords

approximation algorithmmixed packing and coveringparallel algorithmsemidefinite programmingwidth-independent algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
• Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game

This page was built for publication: Positive semidefinite programming: mixed, parallel, and width-independent

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