Recommendations
- On the max min vertex cover problem
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- scientific article; zbMATH DE number 2080196
- On approximability of the independent/connected edge dominating set problems
- Maximum minimal vertex cover parameterized by vertex cover
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1522921 (Why is no real title available?)
- scientific article; zbMATH DE number 4121424 (Why is no real title available?)
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
- Approximating the minimum maximal independence number
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Domination, independent domination, and duality in strongly chordal graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
- Fast algorithms for min independent dominating set
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
- New results on polynomial inapproximability and fixed parameter approximability of \textsc{Edge Dominating Set}
- On Parameterized Approximability
- On Turan's theorem for sparse graphs
- Parameterized Approximation Problems
- Parameterized approximation via fidelity preserving transformations
- The approximation of maximum subgraph problems
Cited in
(25)- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- On the complexity of minimum maximal acyclic matchings
- The Probabilistic Minimum Vertex-covering Problem
- \textsc{MAX MIN} vertex cover and the size of Betti tables
- On the max min vertex cover problem
- Parameterized complexity of computing maximum minimal blocking and hitting sets
- Upper Clique Transversals in Graphs
- (In)approximability of maximum minimal FVS
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- A maximum dicut in a digraph induced by a minimal dominating set
- Minimal zero forcing sets
- Matroid-constrained vertex cover
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- In)approximability of Maximum Minimal FVS
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Complexity of the max cut problem with the minimal domination constraint
- Maximum minimal vertex cover parameterized by vertex cover
- Extension and its price for the connected vertex cover problem
- Computing the largest bond and the maximum connected cut of a graph
- Minimum maximal acyclic matching in proper interval graphs
- Algorithms - ESA 2003
- Weighted upper edge cover: complexity and approximability
- Minimum maximal acyclic matching in proper interval graphs
- On the complexity of minimum maximal acyclic matchings
- Maximum minimal vertex cover parameterized by vertex cover
This page was built for publication: On the max min vertex cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499339)
