Parameterized approximation via fidelity preserving transformations
From MaRDI portal
Recommendations
- Parameterized approximation via fidelity preserving transformations
- Parameterized Approximation Problems
- Fixed-parameter approximation: conceptual framework and approximability results
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- Approximation Theories for Measure Preserving Transformations
- Intrinsic parametrization for approximation
- Parameterized structure-preserving transformations of matrix polynomials
- The maps preserving approximation
- On Parameterized Approximability
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A \(c^k n\) 5-approximation algorithm for treewidth
- A kernelization algorithm for \(d\)-hitting set
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- An approximation algorithm for the maximum leaf spanning arborescence problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Confronting hardness using a hybrid approach
- Confronting intractability via parameters
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Data reductions and combinatorial bounds for improved approximation algorithms
- Deterministic parameterized connected vertex cover
- Exact and approximate bandwidth
- Exact exponential algorithms.
- Exponential-time approximation of weighted set cover
- Fixed-parameter approximation: conceptual framework and approximability results
- Fourier meets M\"{o}bius: fast subset convolution
- Fundamentals of parameterized complexity
- Improved upper bounds for vertex cover
- Introduction to algorithms.
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Lossy kernelization
- On Parameterized Approximability
- On the existence of subexponential parameterized algorithms
- One for the price of two: a unified approach for approximating covering problems
- Parameterized Approximability of the Disjoint Cycle Problem
- Parameterized approximation algorithms for hitting set
- Parameterized approximation of dominating set problems
- Parameterized approximation scheme for the multiple knapsack problem
- Parameterized approximation via fidelity preserving transformations
- Saving on phases: parameterized approximation for total vertex cover
- Set partitioning via inclusion-exclusion
- The design of approximation algorithms
- The steiner problem in graphs
- There is no EPTAS for two-dimensional knapsack
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(8)- Dynamic kernels for hitting sets and set packing
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Parameterized approximation algorithms for weighted vertex cover
- Parameterized approximation via fidelity preserving transformations
- Invited talks
- Improved approximation for transformation diagnostics
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized approximation algorithms for weighted vertex cover
This page was built for publication: Parameterized approximation via fidelity preserving transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686226)
