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):

Displaying 20 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)
• On the max min vertex cover problem (Q499339) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• Algorithms for dominating clique problems (Q1758169) (← links)
• New tools and connections for exponential-time approximation (Q2272598) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• Super-polynomial approximation branching algorithms (Q2954364) (← links)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
• Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)