Pages that link to "Item:Q411835"

The following pages link to Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835):

Displayed 5 items.

• An exponential time 2-approximation algorithm for bandwidth (Q392018) ‎ (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) ‎ (← links)
• Exponential approximation schemata for some network design problems (Q396669) ‎ (← links)
• Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) ‎ (← links)
• Algorithms for dominating clique problems (Q1758169) ‎ (← links)