Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation

DOI10.1007/978-3-642-02026-1_20zbMath1246.90153OpenAlexW1484756516MaRDI QIDQ3637068

Ai-Fan Ling

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_20

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Approximation algorithms (68W25)

Related Items (3)

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding ⋮ Unnamed Item ⋮ A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section

This page was built for publication: Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation