Pages that link to "Item:Q5957907"

The following pages link to MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907):

Displaying 11 items.

• An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
• Exponential-time approximation of weighted set cover (Q989538) (← links)
• Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
• MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564) (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Super-polynomial approximation branching algorithms (Q2954364) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)