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.
- 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)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Low correlation noise stability of symmetric sets (Q2664537) (← links)
- Hypercontractivity via tensor calculus (Q2695312) (← 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)