An improved rounding method and semidefinite programming relaxation for graph partition
From MaRDI portal
Recommendations
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Improved approximation algorithms for maximum graph partitioning problems
- Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations
- Complex semidefinite programming and Max-\(k\)-Cut
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
Cited in
(42)- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Finding connected \(k\)-subgraphs with high density
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Relaxations of combinatorial problems via association schemes
- Graph bisection revisited
- Uniform \(K\)-stability, Duistermaat-Heckman measures and singularities of pairs
- Matroid-constrained vertex cover
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Functorial factorization of birational maps for qe schemes in characteristic 0
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Improved approximation algorithms for maximum graph partitioning problems
- Approximation algorithm for MAX DICUT with given sizes of parts
- SDP-based bounds for graph partition via extended ADMM
- On approximation of max-vertex-cover
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Improved approximations for max set splitting and max NAE SAT
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation
- Finding Connected Dense $$k$$-Subgraphs
- Geometric invariant theory and flips
- Complex semidefinite programming and Max-\(k\)-Cut
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph
- The densest \(k\)-subgraph problem on clique graphs
- A continuation algorithm for max-cut problem
- Equivariant multiplicities of simply-laced type flag minors
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph
- On semidefinite programming relaxations of maximum \(k\)-section
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- A discrete dynamic convexized method for the max-cut problem
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- 𝜋₁ of Hamiltonian 𝑆¹ manifolds
- An efficient semidefinite programming relaxation for the graph partition problem
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- Torification and factorization of birational maps
- Floer cohomology and flips
- Algebraic cuts
This page was built for publication: An improved rounding method and semidefinite programming relaxation for graph partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849503)
