Pages that link to "Item:Q5741729"

The following pages link to Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection (Q5741729):

Displayed 10 items.

• Complexity of approximating CSP with balance/hard constraints (Q315529) ‎ (← links)
• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) ‎ (← links)
• Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) ‎ (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) ‎ (← links)
• Better approximation algorithms for influence maximization in online social networks (Q2352355) ‎ (← 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)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) ‎ (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) ‎ (← links)
• On bisections of graphs without complete bipartite graphs (Q6056762) ‎ (← links)