Pages that link to "Item:Q1878408"
From MaRDI portal
The following pages link to Improved approximations for max set splitting and max NAE SAT (Q1878408):
Displaying 11 items.
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
