Pages that link to "Item:Q5930726"

The following pages link to A .699-approximation algorithm for Max-Bisection. (Q5930726):

Displaying 33 items.

• Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
• A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
• Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
• The capacitated max \(k\)-cut problem (Q930343) (← links)
• A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068) (← links)
• A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
• Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
• An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
• Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• A proximal augmented method for semidefinite programming problems (Q2048441) (← links)
• Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
• Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
• A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
• Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
• Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
• Approximating Max Cut with Limited Unbalance (Q3439482) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
• A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)