Pages that link to "Item:Q3499730"

The following pages link to Parameterized Approximation Problems (Q3499730):

Displaying 28 items.

• Backdoors to q-Horn (Q261394) (← links)
• 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)
• Confronting intractability via parameters (Q465686) (← links)
• Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
• Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
• On the max min vertex cover problem (Q499339) (← links)
• Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
• Parameterizing above or below guaranteed values (Q1004602) (← links)
• Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• Parameterized (in)approximability of subset problems (Q1785218) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
• Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Super-polynomial approximation branching algorithms (Q2954364) (← links)
• Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
• Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
• Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
• Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620) (← 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)
• The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
• Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)