The following pages link to (Q4535020):
Displaying 5 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
