Pages that link to "Item:Q1603473"

The following pages link to A note on approximating Max-Bisection on regular graphs (Q1603473):

Displaying 7 items.

• A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
• Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← 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)
• Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)