Efficient algorithms for the \textsc{max~k-vertex cover problem}
From MaRDI portal
Publication:489714
Recommendations
- Efficient algorithms for the max \(k\)-vertex cover problem
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- An improved fixed-parameter algorithm for vertex cover
- On approximation of max-vertex-cover
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A measure \& conquer approach for the analysis of exact algorithms
- Algorithms and Data Structures
- An exponential time 2-approximation algorithm for bandwidth
- Approximation algorithms for maximization problems arising in graph partitioning
- Approximation of min coloring by moderately exponential algorithms
- Computing small partial coverings
- Easy problems for tree-decomposable graphs
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Efficient algorithms for the max \(k\)-vertex cover problem
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Exact and approximate bandwidth
- Exponential-time approximation of weighted set cover
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- Graph Layout Problems Parameterized by Vertex Cover
- Improved Upper Bounds for Partial Vertex Cover
- Improved approximation algorithms for maximum graph partitioning problems
- Improved upper bounds for vertex cover
- On efficient fixed-parameter algorithms for weighted vertex cover
- Parameterized Approximation Problems
- Pathwidth of cubic graphs and exact algorithms
- Set partitioning via inclusion-exclusion
- Subexponential algorithms for partial cover problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- Treewidth Computation and Extremal Combinatorics
- Vertex cover: Further observations and further improvements
- Which problems have strongly exponential complexity?
Cited in
(7)- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Efficient algorithms for the max \(k\)-vertex cover problem
- A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
- Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems
- An exact algorithm for the maximal covering problem
- Super-polynomial approximation branching algorithms
- Voting on multi-issue domains with conditionally lexicographic preferences
This page was built for publication: Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489714)
