A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem

DOI10.1007/978-3-319-08783-2_28zbMath1423.68602OpenAlexW2243791129MaRDI QIDQ2920470

Da-Chuan Xu, Wen-Qing Xu, Chen-Chen Wu, Dong-lei Du

Publication date: 26 September 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_28

zbMATH Keywords

approximation algorithmroundingbalanced Max-3-Uncutcomplex semidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Approximation and hardness results for the max \(k\)-uncut problem ⋮ Approximation and Hardness Results for the Max k-Uncut Problem ⋮ New algorithms for a simple measure of network partitioning ⋮ New algorithms for a simple measure of network partitioning

This page was built for publication: A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem