The following pages link to On Parameterized Approximability (Q3499729):
Displayed 27 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← 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)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← 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)
- 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)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)