A semidefinite programming approach to the hypergraph minimum bisection problem
From MaRDI portal
Publication:2996813
DOI10.1080/02331930903233744zbMath1231.90365OpenAlexW2011482914MaRDI QIDQ2996813
Publication date: 3 May 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903233744
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)
Related Items (2)
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
Cites Work
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Modeling hypergraphs by graphs with the same mincut properties
- Some simplified NP-complete graph problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
- A Polylogarithmic Approximation of the Minimum Bisection
- Recent directions in netlist partitioning: a survey
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A fast and robust network bisection algorithm
- Computational enhancements in low-rank semidefinite programming
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: A semidefinite programming approach to the hypergraph minimum bisection problem
