An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems

DOI10.1007/978-3-642-38768-5_28zbMath1381.90093OpenAlexW16151075MaRDI QIDQ4925247

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

Publication date: 11 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_28

zbMATH Keywords

approximation algorithmsemidefinite programming hierarchiesgraph bisection problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Better approximation algorithms for influence maximization in online social networks ⋮ An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems