FPT approximations for connected maximum coverage
From MaRDI portal
Cites work
- A note on max k-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
- A parameterized approximation scheme for min \(k\)-cut
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- Analytical approach to parallel repetition
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
- Approximation algorithms for partial covering problems
- Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
- Color-coding
- Constant Time Generation of Rooted Trees
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Finding minimally weighted subgraphs
- Finding small balanced separators
- Fixed-Parameter Tractability and Completeness I: Basic Results
- FPT algorithms for connected feedback vertex set
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- scientific article; zbMATH DE number 1256718 (Why is no real title available?)
- scientific article; zbMATH DE number 1323125 (Why is no real title available?)
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Improved budgeted connected domination and budgeted edge-vertex domination
- Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back
- Losing Treewidth by Separating Subsets
- On the Parameterized Complexity of Approximating Dominating Set
- Parameterized algorithms
- Parameterized approximation for capacitated d-hitting set with hard capacities
- Parameterized approximation schemes for biclique-free \textsc{Max} \(k\)-weight SAT and \textsc{Max} coverage
- Parameterized inapproximability for Steiner orientation by gap amplification
- Parameterized matroid-constrained maximum coverage
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Satisfiability to coverage in presence of fairness, matroid, and global constraints
- Spectral sparsification of graphs
- The constant inapproximability of the parameterized dominating set problem
- The number of trees
- The parameterized complexity of the k-biclique problem
- Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
This page was built for publication: FPT approximations for connected maximum coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445607)