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)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds (Q2037107) (← links)
- Approximation algorithms for balancing signed graphs (Q2039689) (← links)
- The structure of Gaussian minimal bubbles (Q2048298) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- Empirical performance bounds for quantum approximate optimization (Q2099650) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
- Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- Hypergraph cuts above the average (Q2327966) (← 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)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)