Pages that link to "Item:Q5898461"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898461):
Displaying 13 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- Locally defined independence systems on graphs (Q2109105) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
