Pages that link to "Item:Q5454254"
From MaRDI portal
The following pages link to Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254):
Displayed 50 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Standard simplices and pluralities are not the most noise stable (Q314385) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Solution of the propeller conjecture in \(\mathbb R^3\) (Q368772) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← links)
- The maximum cut problem on blow-ups of multiprojective spaces (Q2435039) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Approximate Kernel Clustering (Q3400770) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)