Pages that link to "Item:Q3499727"
From MaRDI portal
The following pages link to Fixed-Parameter Approximation: Conceptual Framework and Approximability Results (Q3499727):
Displaying 22 items.
- 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)
- 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)
- 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)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← 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)
- 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)
