Pages that link to "Item:Q1019736"

The following pages link to Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736):

Displaying 14 items.

• An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
• Exponential approximation schemata for some network design problems (Q396669) (← links)
• Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
• Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
• Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
• Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
• Exponential-time approximation of weighted set cover (Q989538) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Algorithms for dominating clique problems (Q1758169) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
• Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)